./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 35987657 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-?-3598765 [2022-07-20 21:53:01,554 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 21:53:01,556 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 21:53:01,589 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 21:53:01,589 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 21:53:01,590 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 21:53:01,592 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 21:53:01,593 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 21:53:01,594 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 21:53:01,598 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 21:53:01,598 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 21:53:01,600 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 21:53:01,600 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 21:53:01,601 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 21:53:01,602 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 21:53:01,604 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 21:53:01,605 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 21:53:01,606 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 21:53:01,607 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 21:53:01,611 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 21:53:01,612 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 21:53:01,613 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 21:53:01,613 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 21:53:01,614 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 21:53:01,615 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 21:53:01,628 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 21:53:01,628 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 21:53:01,628 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 21:53:01,629 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 21:53:01,629 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 21:53:01,630 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 21:53:01,631 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 21:53:01,632 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 21:53:01,632 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 21:53:01,633 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 21:53:01,633 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 21:53:01,633 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 21:53:01,634 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 21:53:01,634 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 21:53:01,634 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 21:53:01,635 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 21:53:01,636 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 21:53:01,637 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-20 21:53:01,657 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 21:53:01,658 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 21:53:01,658 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 21:53:01,658 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 21:53:01,659 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 21:53:01,659 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 21:53:01,659 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 21:53:01,659 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 21:53:01,659 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 21:53:01,660 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 21:53:01,660 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 21:53:01,660 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 21:53:01,661 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 21:53:01,661 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 21:53:01,661 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-20 21:53:01,661 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 21:53:01,661 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-20 21:53:01,661 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 21:53:01,661 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-20 21:53:01,661 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 21:53:01,662 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-20 21:53:01,662 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 21:53:01,662 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 21:53:01,662 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 21:53:01,662 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 21:53:01,662 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 21:53:01,662 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 21:53:01,663 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-20 21:53:01,663 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 21:53:01,663 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 21:53:01,663 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-20 21:53:01,663 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-20 21:53:01,663 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-20 21:53:01,664 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-20 21:53:01,894 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 21:53:01,922 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 21:53:01,924 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 21:53:01,925 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 21:53:01,925 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 21:53:01,926 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-20 21:53:01,977 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f509c5aa/8d84ffdd955447ad8d80f9d7a72621fe/FLAG58bba6472 [2022-07-20 21:53:02,367 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 21:53:02,368 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-cav19/array_init_pair_symmetr2.c [2022-07-20 21:53:02,372 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f509c5aa/8d84ffdd955447ad8d80f9d7a72621fe/FLAG58bba6472 [2022-07-20 21:53:02,380 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f509c5aa/8d84ffdd955447ad8d80f9d7a72621fe [2022-07-20 21:53:02,382 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 21:53:02,383 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 21:53:02,384 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 21:53:02,384 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 21:53:02,386 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 21:53:02,387 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 09:53:02" (1/1) ... [2022-07-20 21:53:02,387 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b9b7dd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:53:02, skipping insertion in model container [2022-07-20 21:53:02,388 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 09:53:02" (1/1) ... [2022-07-20 21:53:02,394 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 21:53:02,402 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 21:53:02,493 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-20 21:53:02,504 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 21:53:02,509 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 21:53:02,516 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-20 21:53:02,521 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 21:53:02,529 INFO L208 MainTranslator]: Completed translation [2022-07-20 21:53:02,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:53:02 WrapperNode [2022-07-20 21:53:02,530 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 21:53:02,531 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 21:53:02,531 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 21:53:02,531 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 21:53:02,536 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:53:02" (1/1) ... [2022-07-20 21:53:02,546 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:53:02" (1/1) ... [2022-07-20 21:53:02,563 INFO L137 Inliner]: procedures = 15, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 77 [2022-07-20 21:53:02,564 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 21:53:02,564 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 21:53:02,564 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 21:53:02,565 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 21:53:02,570 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:53:02" (1/1) ... [2022-07-20 21:53:02,570 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:53:02" (1/1) ... [2022-07-20 21:53:02,572 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:53:02" (1/1) ... [2022-07-20 21:53:02,572 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:53:02" (1/1) ... [2022-07-20 21:53:02,575 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:53:02" (1/1) ... [2022-07-20 21:53:02,577 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:53:02" (1/1) ... [2022-07-20 21:53:02,578 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:53:02" (1/1) ... [2022-07-20 21:53:02,579 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 21:53:02,580 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 21:53:02,580 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 21:53:02,580 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 21:53:02,589 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:53:02" (1/1) ... [2022-07-20 21:53:02,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 21:53:02,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 21:53:02,645 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-20 21:53:02,648 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-20 21:53:02,681 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 21:53:02,681 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-20 21:53:02,681 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-20 21:53:02,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-20 21:53:02,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-20 21:53:02,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-20 21:53:02,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 21:53:02,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 21:53:02,685 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-20 21:53:02,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 21:53:02,731 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 21:53:02,732 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 21:53:02,837 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 21:53:02,841 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 21:53:02,843 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-20 21:53:02,844 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 09:53:02 BoogieIcfgContainer [2022-07-20 21:53:02,844 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 21:53:02,850 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 21:53:02,859 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 21:53:02,862 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 21:53:02,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 09:53:02" (1/3) ... [2022-07-20 21:53:02,863 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42bd6e4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 09:53:02, skipping insertion in model container [2022-07-20 21:53:02,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:53:02" (2/3) ... [2022-07-20 21:53:02,864 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42bd6e4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 09:53:02, skipping insertion in model container [2022-07-20 21:53:02,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 09:53:02" (3/3) ... [2022-07-20 21:53:02,865 INFO L111 eAbstractionObserver]: Analyzing ICFG array_init_pair_symmetr2.c [2022-07-20 21:53:02,875 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 21:53:02,891 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-20 21:53:02,953 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 21:53:02,957 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@5296ae45, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@31c2ccc4 [2022-07-20 21:53:02,958 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-20 21:53:02,961 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-20 21:53:02,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-20 21:53:02,966 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:53:02,967 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:53:02,967 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:53:02,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:53:02,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1607472667, now seen corresponding path program 1 times [2022-07-20 21:53:02,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 21:53:02,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203521648] [2022-07-20 21:53:02,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:53:02,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 21:53:03,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:03,083 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-20 21:53:03,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 21:53:03,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203521648] [2022-07-20 21:53:03,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203521648] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 21:53:03,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 21:53:03,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 21:53:03,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37807305] [2022-07-20 21:53:03,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 21:53:03,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-20 21:53:03,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 21:53:03,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-20 21:53:03,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-20 21:53:03,117 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-20 21:53:03,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:53:03,134 INFO L93 Difference]: Finished difference Result 50 states and 71 transitions. [2022-07-20 21:53:03,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-20 21:53:03,135 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-20 21:53:03,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:53:03,141 INFO L225 Difference]: With dead ends: 50 [2022-07-20 21:53:03,141 INFO L226 Difference]: Without dead ends: 22 [2022-07-20 21:53:03,146 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-20 21:53:03,149 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-20 21:53:03,150 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-20 21:53:03,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-07-20 21:53:03,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-07-20 21:53:03,184 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-20 21:53:03,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-07-20 21:53:03,186 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 9 [2022-07-20 21:53:03,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:53:03,187 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-07-20 21:53:03,187 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-20 21:53:03,188 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-07-20 21:53:03,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-20 21:53:03,189 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:53:03,190 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:53:03,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-20 21:53:03,190 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:53:03,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:53:03,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1898116011, now seen corresponding path program 1 times [2022-07-20 21:53:03,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 21:53:03,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682215662] [2022-07-20 21:53:03,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:53:03,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 21:53:03,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:03,244 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-20 21:53:03,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 21:53:03,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682215662] [2022-07-20 21:53:03,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682215662] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 21:53:03,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 21:53:03,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 21:53:03,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717444271] [2022-07-20 21:53:03,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 21:53:03,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 21:53:03,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 21:53:03,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 21:53:03,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-20 21:53:03,247 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-20 21:53:03,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:53:03,301 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-07-20 21:53:03,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 21:53:03,302 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-20 21:53:03,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:53:03,303 INFO L225 Difference]: With dead ends: 40 [2022-07-20 21:53:03,303 INFO L226 Difference]: Without dead ends: 30 [2022-07-20 21:53:03,306 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-20 21:53:03,307 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-20 21:53:03,308 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-20 21:53:03,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-20 21:53:03,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2022-07-20 21:53:03,316 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-20 21:53:03,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-07-20 21:53:03,318 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 9 [2022-07-20 21:53:03,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:53:03,318 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-07-20 21:53:03,318 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-20 21:53:03,318 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-07-20 21:53:03,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-20 21:53:03,319 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:53:03,319 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-20 21:53:03,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-20 21:53:03,320 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:53:03,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:53:03,321 INFO L85 PathProgramCache]: Analyzing trace with hash 544146986, now seen corresponding path program 1 times [2022-07-20 21:53:03,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 21:53:03,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513255031] [2022-07-20 21:53:03,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:53:03,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 21:53:03,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:03,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 21:53:03,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:03,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-20 21:53:03,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:03,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-20 21:53:03,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:03,404 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-20 21:53:03,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 21:53:03,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513255031] [2022-07-20 21:53:03,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513255031] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 21:53:03,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [889493034] [2022-07-20 21:53:03,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:53:03,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 21:53:03,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 21:53:03,407 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-20 21:53:03,431 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-20 21:53:03,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:03,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 21:53:03,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 21:53:03,636 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-20 21:53:03,636 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 21:53:03,723 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-20 21:53:03,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [889493034] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 21:53:03,724 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 21:53:03,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 10 [2022-07-20 21:53:03,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573704730] [2022-07-20 21:53:03,726 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 21:53:03,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 21:53:03,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 21:53:03,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 21:53:03,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2022-07-20 21:53:03,731 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-20 21:53:03,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:53:03,901 INFO L93 Difference]: Finished difference Result 72 states and 92 transitions. [2022-07-20 21:53:03,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 21:53:03,902 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-20 21:53:03,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:53:03,905 INFO L225 Difference]: With dead ends: 72 [2022-07-20 21:53:03,905 INFO L226 Difference]: Without dead ends: 61 [2022-07-20 21:53:03,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2022-07-20 21:53:03,908 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-20 21:53:03,909 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-20 21:53:03,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-07-20 21:53:03,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 48. [2022-07-20 21:53:03,915 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-20 21:53:03,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 61 transitions. [2022-07-20 21:53:03,917 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 61 transitions. Word has length 29 [2022-07-20 21:53:03,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:53:03,917 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 61 transitions. [2022-07-20 21:53:03,917 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-20 21:53:03,917 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 61 transitions. [2022-07-20 21:53:03,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-07-20 21:53:03,919 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:53:03,919 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-20 21:53:03,937 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-20 21:53:04,131 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-20 21:53:04,132 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:53:04,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:53:04,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1645511465, now seen corresponding path program 2 times [2022-07-20 21:53:04,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 21:53:04,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861024480] [2022-07-20 21:53:04,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:53:04,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 21:53:04,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:04,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 21:53:04,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:04,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-20 21:53:04,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:04,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-20 21:53:04,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:04,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-20 21:53:04,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:04,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 21:53:04,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:04,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-20 21:53:04,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:04,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-20 21:53:04,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:04,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 21:53:04,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:04,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-20 21:53:04,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:04,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-20 21:53:04,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:04,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-20 21:53:04,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:04,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 21:53:04,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:04,338 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-20 21:53:04,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 21:53:04,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861024480] [2022-07-20 21:53:04,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861024480] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 21:53:04,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528748151] [2022-07-20 21:53:04,338 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 21:53:04,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 21:53:04,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 21:53:04,340 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-20 21:53:04,341 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-20 21:53:04,425 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 21:53:04,426 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 21:53:04,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-20 21:53:04,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 21:53:04,631 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-20 21:53:04,631 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 21:53:04,757 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-20 21:53:04,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528748151] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 21:53:04,758 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 21:53:04,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 19 [2022-07-20 21:53:04,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524694815] [2022-07-20 21:53:04,759 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 21:53:04,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-20 21:53:04,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 21:53:04,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-20 21:53:04,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=195, Unknown=0, NotChecked=0, Total=342 [2022-07-20 21:53:04,760 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-20 21:53:05,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:53:05,048 INFO L93 Difference]: Finished difference Result 162 states and 206 transitions. [2022-07-20 21:53:05,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-20 21:53:05,049 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-20 21:53:05,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:53:05,051 INFO L225 Difference]: With dead ends: 162 [2022-07-20 21:53:05,051 INFO L226 Difference]: Without dead ends: 145 [2022-07-20 21:53:05,051 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=222, Invalid=330, Unknown=0, NotChecked=0, Total=552 [2022-07-20 21:53:05,052 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-20 21:53:05,052 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-20 21:53:05,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-07-20 21:53:05,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 96. [2022-07-20 21:53:05,063 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-20 21:53:05,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 127 transitions. [2022-07-20 21:53:05,064 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 127 transitions. Word has length 89 [2022-07-20 21:53:05,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:53:05,065 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 127 transitions. [2022-07-20 21:53:05,065 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-20 21:53:05,065 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 127 transitions. [2022-07-20 21:53:05,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2022-07-20 21:53:05,068 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:53:05,068 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-20 21:53:05,108 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-20 21:53:05,285 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-20 21:53:05,286 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:53:05,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:53:05,286 INFO L85 PathProgramCache]: Analyzing trace with hash 548463335, now seen corresponding path program 3 times [2022-07-20 21:53:05,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 21:53:05,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496051614] [2022-07-20 21:53:05,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:53:05,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 21:53:05,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:05,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 21:53:05,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:05,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-20 21:53:05,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:05,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-20 21:53:05,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:05,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-20 21:53:05,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:05,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 21:53:05,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:05,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-20 21:53:05,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:05,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-20 21:53:05,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:05,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 21:53:05,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:05,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-20 21:53:05,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:05,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-20 21:53:05,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:05,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-20 21:53:05,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:05,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 21:53:05,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:05,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-20 21:53:05,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:05,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-20 21:53:05,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:05,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-20 21:53:05,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:05,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-20 21:53:05,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:05,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-20 21:53:05,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:05,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-20 21:53:05,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:05,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-20 21:53:05,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:05,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 21:53:05,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:05,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-20 21:53:05,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:05,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-20 21:53:05,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:05,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-20 21:53:05,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:05,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-20 21:53:05,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:05,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-20 21:53:05,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:05,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-20 21:53:05,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:05,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-20 21:53:05,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:05,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-20 21:53:05,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:05,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-20 21:53:05,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:05,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-20 21:53:05,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:05,677 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-20 21:53:05,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 21:53:05,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496051614] [2022-07-20 21:53:05,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496051614] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 21:53:05,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459603607] [2022-07-20 21:53:05,678 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-20 21:53:05,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 21:53:05,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 21:53:05,704 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-20 21:53:05,705 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-20 21:53:06,184 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-07-20 21:53:06,185 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 21:53:06,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-20 21:53:06,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 21:53:06,502 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-20 21:53:06,502 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 21:53:06,766 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-20 21:53:06,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1459603607] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 21:53:06,767 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 21:53:06,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 37 [2022-07-20 21:53:06,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006031811] [2022-07-20 21:53:06,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 21:53:06,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-07-20 21:53:06,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 21:53:06,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-07-20 21:53:06,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=579, Invalid=753, Unknown=0, NotChecked=0, Total=1332 [2022-07-20 21:53:06,770 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-20 21:53:07,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:53:07,459 INFO L93 Difference]: Finished difference Result 342 states and 434 transitions. [2022-07-20 21:53:07,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-20 21:53:07,460 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-20 21:53:07,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:53:07,462 INFO L225 Difference]: With dead ends: 342 [2022-07-20 21:53:07,462 INFO L226 Difference]: Without dead ends: 313 [2022-07-20 21:53:07,463 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-20 21:53:07,464 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-20 21:53:07,464 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-20 21:53:07,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2022-07-20 21:53:07,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 192. [2022-07-20 21:53:07,480 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-20 21:53:07,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 259 transitions. [2022-07-20 21:53:07,482 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 259 transitions. Word has length 209 [2022-07-20 21:53:07,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:53:07,482 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 259 transitions. [2022-07-20 21:53:07,483 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-20 21:53:07,483 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 259 transitions. [2022-07-20 21:53:07,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2022-07-20 21:53:07,488 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:53:07,488 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-20 21:53:07,522 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-20 21:53:07,695 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-20 21:53:07,696 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:53:07,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:53:07,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1915094685, now seen corresponding path program 4 times [2022-07-20 21:53:07,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 21:53:07,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531815421] [2022-07-20 21:53:07,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:53:07,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 21:53:07,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:08,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 21:53:08,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:08,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-20 21:53:08,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:08,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-20 21:53:08,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:08,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-20 21:53:08,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:08,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 21:53:08,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:08,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-20 21:53:08,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:08,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-20 21:53:08,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:08,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 21:53:08,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:08,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-20 21:53:08,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:08,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-20 21:53:08,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:08,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-20 21:53:08,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:08,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 21:53:08,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:08,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-20 21:53:08,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:08,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-20 21:53:08,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:08,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-20 21:53:08,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:08,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-20 21:53:08,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:08,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-20 21:53:08,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:08,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-20 21:53:08,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:08,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-20 21:53:08,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:08,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 21:53:08,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:08,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-20 21:53:08,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:08,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-20 21:53:08,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:08,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-20 21:53:08,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:08,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-20 21:53:08,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:08,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-20 21:53:08,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:08,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-20 21:53:08,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:08,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-20 21:53:08,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:08,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-20 21:53:08,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:08,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-20 21:53:08,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:08,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-20 21:53:08,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:08,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-20 21:53:08,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:08,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-20 21:53:08,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:08,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2022-07-20 21:53:08,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:08,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-20 21:53:08,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:08,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2022-07-20 21:53:08,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:08,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2022-07-20 21:53:08,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:08,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-20 21:53:08,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:08,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-20 21:53:08,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:08,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-07-20 21:53:08,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:08,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-07-20 21:53:08,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:08,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2022-07-20 21:53:08,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:08,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2022-07-20 21:53:08,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:08,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2022-07-20 21:53:08,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:08,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2022-07-20 21:53:08,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:08,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2022-07-20 21:53:08,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:08,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 273 [2022-07-20 21:53:08,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:08,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2022-07-20 21:53:08,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:08,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2022-07-20 21:53:08,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:08,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2022-07-20 21:53:08,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:08,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 296 [2022-07-20 21:53:08,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:08,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 301 [2022-07-20 21:53:08,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:08,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 309 [2022-07-20 21:53:08,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:08,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 314 [2022-07-20 21:53:08,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:08,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 319 [2022-07-20 21:53:08,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:08,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 327 [2022-07-20 21:53:08,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:08,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 332 [2022-07-20 21:53:08,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:08,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 337 [2022-07-20 21:53:08,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:08,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 345 [2022-07-20 21:53:08,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:08,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 350 [2022-07-20 21:53:08,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:08,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 355 [2022-07-20 21:53:08,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:08,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 363 [2022-07-20 21:53:08,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:08,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 368 [2022-07-20 21:53:08,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:08,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 373 [2022-07-20 21:53:08,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:08,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 381 [2022-07-20 21:53:08,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:08,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 386 [2022-07-20 21:53:08,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:08,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 391 [2022-07-20 21:53:08,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:53:08,227 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-20 21:53:08,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 21:53:08,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531815421] [2022-07-20 21:53:08,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531815421] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 21:53:08,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195772643] [2022-07-20 21:53:08,228 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-20 21:53:08,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 21:53:08,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 21:53:08,244 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-20 21:53:08,297 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-20 21:53:08,512 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-20 21:53:08,512 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 21:53:08,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 894 conjuncts, 280 conjunts are in the unsatisfiable core [2022-07-20 21:53:08,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 21:53:08,589 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-20 21:53:08,589 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-20 21:53:08,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:53:08,782 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-20 21:53:08,787 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-20 21:53:08,790 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-20 21:53:08,793 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-20 21:53:09,118 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-20 21:53:09,118 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-20 21:53:09,394 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-20 21:53:09,394 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-20 21:53:09,669 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-20 21:53:09,670 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-20 21:53:09,988 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-20 21:53:09,989 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-20 21:53:10,293 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-20 21:53:10,293 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-20 21:53:10,585 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-20 21:53:10,586 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-20 21:53:10,892 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-20 21:53:10,893 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-20 21:53:11,202 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-20 21:53:11,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-20 21:53:11,511 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-20 21:53:11,511 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-20 21:53:11,820 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-20 21:53:11,821 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-20 21:53:12,124 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-20 21:53:12,124 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-20 21:53:12,467 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-20 21:53:12,467 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-20 21:53:12,773 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-20 21:53:12,774 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-20 21:53:13,090 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-20 21:53:13,090 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-20 21:53:13,415 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-20 21:53:13,416 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-20 21:53:13,746 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-20 21:53:13,747 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-20 21:53:14,057 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-20 21:53:14,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-20 21:53:14,377 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-20 21:53:14,378 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-20 21:53:14,698 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-20 21:53:14,699 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-20 21:53:14,997 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-20 21:53:14,998 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-20 21:53:15,072 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-20 21:53:15,105 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-20 21:53:15,240 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-20 21:53:15,240 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-20 21:53:15,319 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-20 21:53:15,319 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-20 21:53:15,395 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-20 21:53:15,395 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-20 21:53:15,475 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-20 21:53:15,475 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-20 21:53:15,555 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-20 21:53:15,555 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-20 21:53:15,637 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-20 21:53:15,637 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-20 21:53:15,718 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-20 21:53:15,718 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-20 21:53:15,813 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-20 21:53:15,813 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-20 21:53:15,896 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-20 21:53:15,896 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-20 21:53:15,978 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-20 21:53:15,978 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-20 21:53:16,085 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-20 21:53:16,086 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-20 21:53:16,186 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-20 21:53:16,187 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-20 21:53:16,259 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-20 21:53:16,260 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-20 21:53:16,343 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-20 21:53:16,343 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-20 21:53:16,422 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-20 21:53:16,422 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-20 21:53:16,525 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-20 21:53:16,525 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-20 21:53:16,597 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-20 21:53:16,597 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-20 21:53:16,670 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-20 21:53:16,670 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-20 21:53:16,743 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-20 21:53:16,744 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-20 21:53:16,832 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-20 21:53:16,832 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-20 21:53:16,937 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-20 21:53:16,972 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-20 21:53:16,972 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 21:53:19,140 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-20 21:53:29,937 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-20 21:54:10,793 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_119| Int)) (or (forall ((v_ArrVal_851 Int) (|v_ULTIMATE.start_main_~i~0#1_118| Int) (|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 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#c~0#1.base|) (+ (* |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|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_119|)))) is different from false [2022-07-20 21:55:07,928 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