./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 791161d1 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-?-791161d [2022-07-22 10:30:28,757 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 10:30:28,760 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 10:30:28,790 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 10:30:28,791 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 10:30:28,793 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 10:30:28,797 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 10:30:28,802 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 10:30:28,804 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 10:30:28,808 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 10:30:28,809 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 10:30:28,811 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 10:30:28,811 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 10:30:28,813 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 10:30:28,815 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 10:30:28,817 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 10:30:28,818 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 10:30:28,820 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 10:30:28,824 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 10:30:28,828 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 10:30:28,830 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 10:30:28,831 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 10:30:28,831 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 10:30:28,832 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 10:30:28,833 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 10:30:28,837 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 10:30:28,837 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 10:30:28,837 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 10:30:28,838 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 10:30:28,839 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 10:30:28,840 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 10:30:28,841 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 10:30:28,842 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 10:30:28,842 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 10:30:28,843 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 10:30:28,843 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 10:30:28,843 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 10:30:28,844 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 10:30:28,844 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 10:30:28,844 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 10:30:28,845 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 10:30:28,846 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 10:30:28,847 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 10:30:28,873 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 10:30:28,874 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 10:30:28,874 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 10:30:28,874 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 10:30:28,875 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 10:30:28,875 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 10:30:28,875 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 10:30:28,875 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 10:30:28,876 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 10:30:28,876 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 10:30:28,877 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 10:30:28,877 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 10:30:28,877 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 10:30:28,877 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 10:30:28,877 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 10:30:28,877 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 10:30:28,877 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 10:30:28,878 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 10:30:28,879 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 10:30:28,879 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 10:30:28,879 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 10:30:28,880 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 10:30:28,880 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 10:30:28,880 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 10:30:28,880 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 10:30:28,880 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 10:30:28,880 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 10:30:28,880 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 10:30:28,881 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 10:30:28,881 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 10:30:28,881 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 10:30:28,881 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 10:30:28,881 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 10:30:28,881 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-22 10:30:29,059 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 10:30:29,074 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 10:30:29,076 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 10:30:29,076 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 10:30:29,077 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 10:30:29,078 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-22 10:30:29,114 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/677dc5c7f/d7174d51cc6b4fcfb78d065b1481ab7b/FLAGab3392ce1 [2022-07-22 10:30:29,483 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 10:30:29,483 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-cav19/array_init_pair_symmetr2.c [2022-07-22 10:30:29,488 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/677dc5c7f/d7174d51cc6b4fcfb78d065b1481ab7b/FLAGab3392ce1 [2022-07-22 10:30:29,503 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/677dc5c7f/d7174d51cc6b4fcfb78d065b1481ab7b [2022-07-22 10:30:29,505 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 10:30:29,506 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 10:30:29,507 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 10:30:29,508 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 10:30:29,510 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 10:30:29,510 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 10:30:29" (1/1) ... [2022-07-22 10:30:29,511 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@be2022b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:30:29, skipping insertion in model container [2022-07-22 10:30:29,511 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 10:30:29" (1/1) ... [2022-07-22 10:30:29,516 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 10:30:29,530 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 10:30:29,676 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-22 10:30:29,694 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 10:30:29,699 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 10:30:29,710 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-22 10:30:29,723 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 10:30:29,733 INFO L208 MainTranslator]: Completed translation [2022-07-22 10:30:29,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:30:29 WrapperNode [2022-07-22 10:30:29,734 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 10:30:29,735 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 10:30:29,735 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 10:30:29,735 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 10:30:29,740 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:30:29" (1/1) ... [2022-07-22 10:30:29,746 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:30:29" (1/1) ... [2022-07-22 10:30:29,765 INFO L137 Inliner]: procedures = 15, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 77 [2022-07-22 10:30:29,766 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 10:30:29,767 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 10:30:29,767 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 10:30:29,767 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 10:30:29,772 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:30:29" (1/1) ... [2022-07-22 10:30:29,772 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:30:29" (1/1) ... [2022-07-22 10:30:29,776 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:30:29" (1/1) ... [2022-07-22 10:30:29,776 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:30:29" (1/1) ... [2022-07-22 10:30:29,786 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:30:29" (1/1) ... [2022-07-22 10:30:29,789 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:30:29" (1/1) ... [2022-07-22 10:30:29,795 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:30:29" (1/1) ... [2022-07-22 10:30:29,797 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 10:30:29,799 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 10:30:29,799 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 10:30:29,799 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 10:30:29,800 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:30:29" (1/1) ... [2022-07-22 10:30:29,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 10:30:29,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:30:29,822 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-22 10:30:29,839 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-22 10:30:29,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 10:30:29,863 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-22 10:30:29,864 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-22 10:30:29,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 10:30:29,864 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 10:30:29,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 10:30:29,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 10:30:29,864 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 10:30:29,864 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 10:30:29,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 10:30:29,913 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 10:30:29,914 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 10:30:30,005 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 10:30:30,008 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 10:30:30,009 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-22 10:30:30,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 10:30:30 BoogieIcfgContainer [2022-07-22 10:30:30,010 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 10:30:30,011 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 10:30:30,011 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 10:30:30,013 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 10:30:30,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 10:30:29" (1/3) ... [2022-07-22 10:30:30,014 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e80315c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 10:30:30, skipping insertion in model container [2022-07-22 10:30:30,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:30:29" (2/3) ... [2022-07-22 10:30:30,014 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e80315c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 10:30:30, skipping insertion in model container [2022-07-22 10:30:30,015 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 10:30:30" (3/3) ... [2022-07-22 10:30:30,015 INFO L111 eAbstractionObserver]: Analyzing ICFG array_init_pair_symmetr2.c [2022-07-22 10:30:30,024 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 10:30:30,024 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 10:30:30,060 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 10:30:30,064 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@47b9bde9, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2ff8f5cc [2022-07-22 10:30:30,064 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 10:30:30,067 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-22 10:30:30,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-22 10:30:30,071 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:30:30,071 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:30:30,072 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:30:30,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:30:30,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1607472667, now seen corresponding path program 1 times [2022-07-22 10:30:30,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:30:30,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736959089] [2022-07-22 10:30:30,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:30:30,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:30:30,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:30,210 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-22 10:30:30,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:30:30,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736959089] [2022-07-22 10:30:30,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736959089] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 10:30:30,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 10:30:30,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 10:30:30,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875933245] [2022-07-22 10:30:30,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 10:30:30,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-22 10:30:30,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:30:30,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-22 10:30:30,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 10:30:30,240 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-22 10:30:30,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:30:30,259 INFO L93 Difference]: Finished difference Result 50 states and 71 transitions. [2022-07-22 10:30:30,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 10:30:30,260 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-22 10:30:30,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:30:30,266 INFO L225 Difference]: With dead ends: 50 [2022-07-22 10:30:30,266 INFO L226 Difference]: Without dead ends: 22 [2022-07-22 10:30:30,269 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-22 10:30:30,275 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-22 10:30:30,276 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-22 10:30:30,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-07-22 10:30:30,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-07-22 10:30:30,301 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-22 10:30:30,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-07-22 10:30:30,303 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 9 [2022-07-22 10:30:30,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:30:30,304 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-07-22 10:30:30,304 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-22 10:30:30,305 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-07-22 10:30:30,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-22 10:30:30,306 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:30:30,307 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:30:30,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 10:30:30,308 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:30:30,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:30:30,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1898116011, now seen corresponding path program 1 times [2022-07-22 10:30:30,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:30:30,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319267274] [2022-07-22 10:30:30,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:30:30,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:30:30,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:30,370 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-22 10:30:30,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:30:30,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319267274] [2022-07-22 10:30:30,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319267274] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 10:30:30,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 10:30:30,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 10:30:30,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117604786] [2022-07-22 10:30:30,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 10:30:30,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 10:30:30,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:30:30,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 10:30:30,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-22 10:30:30,377 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-22 10:30:30,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:30:30,451 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-07-22 10:30:30,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 10:30:30,451 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-22 10:30:30,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:30:30,452 INFO L225 Difference]: With dead ends: 40 [2022-07-22 10:30:30,452 INFO L226 Difference]: Without dead ends: 30 [2022-07-22 10:30:30,460 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-22 10:30:30,461 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 34 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-07-22 10:30:30,462 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.1s Time] [2022-07-22 10:30:30,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-22 10:30:30,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2022-07-22 10:30:30,468 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-22 10:30:30,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-07-22 10:30:30,469 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 9 [2022-07-22 10:30:30,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:30:30,469 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-07-22 10:30:30,470 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-22 10:30:30,470 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-07-22 10:30:30,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-22 10:30:30,471 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:30:30,471 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-22 10:30:30,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 10:30:30,471 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:30:30,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:30:30,472 INFO L85 PathProgramCache]: Analyzing trace with hash 544146986, now seen corresponding path program 1 times [2022-07-22 10:30:30,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:30:30,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642591991] [2022-07-22 10:30:30,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:30:30,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:30:30,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:30,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 10:30:30,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:30,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 10:30:30,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:30,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 10:30:30,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:30,587 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-22 10:30:30,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:30:30,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642591991] [2022-07-22 10:30:30,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642591991] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:30:30,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320617727] [2022-07-22 10:30:30,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:30:30,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:30:30,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:30:30,614 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-22 10:30:30,617 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-22 10:30:30,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:30,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 10:30:30,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:30:30,852 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-22 10:30:30,852 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:30:30,890 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-22 10:30:30,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1320617727] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:30:30,891 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:30:30,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 10 [2022-07-22 10:30:30,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972116477] [2022-07-22 10:30:30,892 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:30:30,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-22 10:30:30,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:30:30,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-22 10:30:30,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2022-07-22 10:30:30,893 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-22 10:30:31,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:30:31,028 INFO L93 Difference]: Finished difference Result 72 states and 92 transitions. [2022-07-22 10:30:31,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 10:30:31,028 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-22 10:30:31,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:30:31,030 INFO L225 Difference]: With dead ends: 72 [2022-07-22 10:30:31,030 INFO L226 Difference]: Without dead ends: 61 [2022-07-22 10:30:31,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2022-07-22 10:30:31,035 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-22 10:30:31,036 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-22 10:30:31,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-07-22 10:30:31,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 48. [2022-07-22 10:30:31,052 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-22 10:30:31,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 61 transitions. [2022-07-22 10:30:31,055 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 61 transitions. Word has length 29 [2022-07-22 10:30:31,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:30:31,056 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 61 transitions. [2022-07-22 10:30:31,056 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-22 10:30:31,056 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 61 transitions. [2022-07-22 10:30:31,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-07-22 10:30:31,059 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:30:31,059 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-22 10:30:31,077 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-22 10:30:31,276 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-22 10:30:31,276 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:30:31,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:30:31,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1645511465, now seen corresponding path program 2 times [2022-07-22 10:30:31,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:30:31,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556153957] [2022-07-22 10:30:31,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:30:31,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:30:31,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:31,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 10:30:31,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:31,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 10:30:31,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:31,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 10:30:31,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:31,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 10:30:31,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:31,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-22 10:30:31,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:31,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-22 10:30:31,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:31,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-22 10:30:31,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:31,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 10:30:31,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:31,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-22 10:30:31,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:31,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-22 10:30:31,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:31,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-22 10:30:31,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:31,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-22 10:30:31,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:31,462 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-22 10:30:31,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:30:31,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556153957] [2022-07-22 10:30:31,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556153957] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:30:31,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312676530] [2022-07-22 10:30:31,463 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 10:30:31,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:30:31,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:30:31,478 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-22 10:30:31,519 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-22 10:30:31,596 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 10:30:31,597 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:30:31,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-22 10:30:31,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:30:31,804 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-22 10:30:31,805 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:30:31,929 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-22 10:30:31,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312676530] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:30:31,929 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:30:31,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 19 [2022-07-22 10:30:31,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982764029] [2022-07-22 10:30:31,931 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:30:31,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-22 10:30:31,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:30:31,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-22 10:30:31,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=195, Unknown=0, NotChecked=0, Total=342 [2022-07-22 10:30:31,935 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-22 10:30:32,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:30:32,215 INFO L93 Difference]: Finished difference Result 162 states and 206 transitions. [2022-07-22 10:30:32,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-22 10:30:32,215 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-22 10:30:32,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:30:32,217 INFO L225 Difference]: With dead ends: 162 [2022-07-22 10:30:32,217 INFO L226 Difference]: Without dead ends: 145 [2022-07-22 10:30:32,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=222, Invalid=330, Unknown=0, NotChecked=0, Total=552 [2022-07-22 10:30:32,218 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-22 10:30:32,218 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-22 10:30:32,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-07-22 10:30:32,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 96. [2022-07-22 10:30:32,229 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-22 10:30:32,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 127 transitions. [2022-07-22 10:30:32,230 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 127 transitions. Word has length 89 [2022-07-22 10:30:32,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:30:32,230 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 127 transitions. [2022-07-22 10:30:32,231 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-22 10:30:32,231 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 127 transitions. [2022-07-22 10:30:32,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2022-07-22 10:30:32,233 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:30:32,233 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-22 10:30:32,259 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-22 10:30:32,444 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-22 10:30:32,444 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:30:32,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:30:32,445 INFO L85 PathProgramCache]: Analyzing trace with hash 548463335, now seen corresponding path program 3 times [2022-07-22 10:30:32,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:30:32,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765185168] [2022-07-22 10:30:32,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:30:32,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:30:32,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:32,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 10:30:32,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:32,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 10:30:32,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:32,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 10:30:32,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:32,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 10:30:32,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:32,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-22 10:30:32,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:32,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-22 10:30:32,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:32,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-22 10:30:32,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:32,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 10:30:32,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:32,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-22 10:30:32,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:32,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-22 10:30:32,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:32,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-22 10:30:32,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:32,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-22 10:30:32,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:32,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-22 10:30:32,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:32,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-22 10:30:32,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:32,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-22 10:30:32,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:32,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-22 10:30:32,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:32,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-22 10:30:32,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:32,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-22 10:30:32,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:32,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-22 10:30:32,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:32,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-22 10:30:32,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:32,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-22 10:30:32,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:32,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-22 10:30:32,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:32,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-22 10:30:32,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:32,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-22 10:30:32,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:32,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-22 10:30:32,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:32,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-22 10:30:32,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:32,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-22 10:30:32,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:32,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-22 10:30:32,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:32,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-22 10:30:32,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:32,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-22 10:30:32,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:32,728 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-22 10:30:32,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:30:32,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765185168] [2022-07-22 10:30:32,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765185168] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:30:32,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067218791] [2022-07-22 10:30:32,729 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-22 10:30:32,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:30:32,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:30:32,730 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-22 10:30:32,731 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-22 10:30:33,182 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-07-22 10:30:33,183 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:30:33,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-22 10:30:33,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:30:33,478 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-22 10:30:33,478 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:30:33,755 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-22 10:30:33,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1067218791] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:30:33,756 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:30:33,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 37 [2022-07-22 10:30:33,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175778354] [2022-07-22 10:30:33,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:30:33,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-07-22 10:30:33,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:30:33,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-07-22 10:30:33,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=579, Invalid=753, Unknown=0, NotChecked=0, Total=1332 [2022-07-22 10:30:33,760 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-22 10:30:34,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:30:34,366 INFO L93 Difference]: Finished difference Result 342 states and 434 transitions. [2022-07-22 10:30:34,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-22 10:30:34,366 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-22 10:30:34,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:30:34,371 INFO L225 Difference]: With dead ends: 342 [2022-07-22 10:30:34,371 INFO L226 Difference]: Without dead ends: 313 [2022-07-22 10:30:34,373 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-22 10:30:34,374 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 677 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 514 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2022-07-22 10:30:34,375 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.4s Time] [2022-07-22 10:30:34,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2022-07-22 10:30:34,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 192. [2022-07-22 10:30:34,405 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-22 10:30:34,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 259 transitions. [2022-07-22 10:30:34,406 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 259 transitions. Word has length 209 [2022-07-22 10:30:34,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:30:34,407 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 259 transitions. [2022-07-22 10:30:34,407 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-22 10:30:34,407 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 259 transitions. [2022-07-22 10:30:34,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2022-07-22 10:30:34,411 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:30:34,412 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-22 10:30:34,443 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-22 10:30:34,629 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-22 10:30:34,630 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:30:34,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:30:34,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1915094685, now seen corresponding path program 4 times [2022-07-22 10:30:34,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:30:34,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782333502] [2022-07-22 10:30:34,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:30:34,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:30:34,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:34,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 10:30:34,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:34,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 10:30:34,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:35,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 10:30:35,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:35,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 10:30:35,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:35,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-22 10:30:35,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:35,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-22 10:30:35,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:35,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-22 10:30:35,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:35,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 10:30:35,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:35,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-22 10:30:35,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:35,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-22 10:30:35,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:35,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-22 10:30:35,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:35,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-22 10:30:35,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:35,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-22 10:30:35,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:35,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-22 10:30:35,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:35,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-22 10:30:35,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:35,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-22 10:30:35,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:35,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-22 10:30:35,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:35,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-22 10:30:35,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:35,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-22 10:30:35,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:35,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-22 10:30:35,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:35,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-22 10:30:35,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:35,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-22 10:30:35,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:35,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-22 10:30:35,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:35,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-22 10:30:35,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:35,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-22 10:30:35,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:35,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-22 10:30:35,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:35,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-22 10:30:35,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:35,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-22 10:30:35,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:35,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-22 10:30:35,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:35,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-22 10:30:35,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:35,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-22 10:30:35,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:35,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-22 10:30:35,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:35,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2022-07-22 10:30:35,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:35,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-22 10:30:35,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:35,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2022-07-22 10:30:35,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:35,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2022-07-22 10:30:35,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:35,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-22 10:30:35,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:35,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-22 10:30:35,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:35,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-07-22 10:30:35,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:35,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-07-22 10:30:35,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:35,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2022-07-22 10:30:35,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:35,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2022-07-22 10:30:35,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:35,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2022-07-22 10:30:35,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:35,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2022-07-22 10:30:35,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:35,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2022-07-22 10:30:35,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:35,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 273 [2022-07-22 10:30:35,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:35,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2022-07-22 10:30:35,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:35,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2022-07-22 10:30:35,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:35,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2022-07-22 10:30:35,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:35,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 296 [2022-07-22 10:30:35,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:35,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 301 [2022-07-22 10:30:35,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:35,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 309 [2022-07-22 10:30:35,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:35,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 314 [2022-07-22 10:30:35,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:35,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 319 [2022-07-22 10:30:35,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:35,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 327 [2022-07-22 10:30:35,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:35,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 332 [2022-07-22 10:30:35,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:35,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 337 [2022-07-22 10:30:35,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:35,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 345 [2022-07-22 10:30:35,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:35,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 350 [2022-07-22 10:30:35,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:35,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 355 [2022-07-22 10:30:35,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:35,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 363 [2022-07-22 10:30:35,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:35,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 368 [2022-07-22 10:30:35,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:35,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 373 [2022-07-22 10:30:35,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:35,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 381 [2022-07-22 10:30:35,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:35,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 386 [2022-07-22 10:30:35,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:35,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 391 [2022-07-22 10:30:35,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:30:35,186 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-22 10:30:35,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:30:35,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782333502] [2022-07-22 10:30:35,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782333502] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:30:35,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655188513] [2022-07-22 10:30:35,188 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-22 10:30:35,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:30:35,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:30:35,192 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-22 10:30:35,225 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-22 10:30:35,424 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-22 10:30:35,425 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:30:35,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 894 conjuncts, 280 conjunts are in the unsatisfiable core [2022-07-22 10:30:35,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:30:35,497 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-22 10:30:35,498 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-22 10:30:35,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:30:35,659 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-22 10:30:35,685 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-22 10:30:35,690 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-22 10:30:35,693 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-22 10:30:36,035 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-22 10:30:36,036 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-22 10:30:36,338 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-22 10:30:36,339 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-22 10:30:36,668 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-22 10:30:36,668 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-22 10:30:36,964 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-22 10:30:36,965 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-22 10:30:37,263 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-22 10:30:37,264 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-22 10:30:37,548 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-22 10:30:37,548 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-22 10:30:37,832 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-22 10:30:37,832 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-22 10:30:38,131 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-22 10:30:38,131 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-22 10:30:38,418 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-22 10:30:38,418 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-22 10:30:38,732 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-22 10:30:38,733 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-22 10:30:39,032 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-22 10:30:39,032 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-22 10:30:39,361 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-22 10:30:39,362 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-22 10:30:39,659 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-22 10:30:39,659 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-22 10:30:39,961 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-22 10:30:39,961 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-22 10:30:40,269 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-22 10:30:40,269 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-22 10:30:40,624 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-22 10:30:40,625 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-22 10:30:40,952 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-22 10:30:40,952 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-22 10:30:41,264 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-22 10:30:41,264 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-22 10:30:41,554 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-22 10:30:41,554 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-22 10:30:41,866 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-22 10:30:41,866 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-22 10:30:41,921 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-22 10:30:41,949 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-22 10:30:42,049 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-22 10:30:42,049 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-22 10:30:42,114 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-22 10:30:42,114 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-22 10:30:42,180 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-22 10:30:42,184 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 47 [2022-07-22 10:30:42,272 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-22 10:30:42,272 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-22 10:30:42,366 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-22 10:30:42,366 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-22 10:30:42,455 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-22 10:30:42,456 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-22 10:30:42,521 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-22 10:30:42,522 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-22 10:30:42,587 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-22 10:30:42,587 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-22 10:30:42,655 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-22 10:30:42,655 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-22 10:30:42,739 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-22 10:30:42,739 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-22 10:30:42,810 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-22 10:30:42,810 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 47 [2022-07-22 10:30:42,905 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-22 10:30:42,906 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-22 10:30:42,973 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-22 10:30:42,974 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-22 10:30:43,064 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-22 10:30:43,065 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-22 10:30:43,137 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-22 10:30:43,137 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-22 10:30:43,210 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-22 10:30:43,210 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 47 [2022-07-22 10:30:43,282 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-22 10:30:43,282 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-22 10:30:43,356 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-22 10:30:43,357 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-22 10:30:43,431 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-22 10:30:43,431 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-22 10:30:43,532 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-22 10:30:43,532 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-22 10:30:43,665 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-22 10:30:43,708 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-22 10:30:43,709 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:30:45,854 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-22 10:30:56,752 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-22 10:33:42,820 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 [2022-07-22 10:34:43,566 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_121| Int)) (or (forall ((v_ArrVal_851 Int) (|v_ULTIMATE.start_main_~i~0#1_120| Int) (v_ArrVal_848 Int) (v_ArrVal_846 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|)) (< 0 (select (store (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_121| 4)) v_ArrVal_846) (+ |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_121| 1) |v_ULTIMATE.start_main_~i~0#1_120|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_120| 1) |v_ULTIMATE.start_main_~i~0#1_119|)) (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_121|)))) is different from false