./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-tiling/mbpr2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c 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-tiling/mbpr2.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 a98ea70d5d9f752732070144a56514c68e9571f139726211e2f0ade721d6c5f3 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-11 22:21:35,754 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-11 22:21:35,756 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-11 22:21:35,794 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-11 22:21:35,794 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-11 22:21:35,796 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-11 22:21:35,797 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-11 22:21:35,802 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-11 22:21:35,803 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-11 22:21:35,807 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-11 22:21:35,808 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-11 22:21:35,810 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-11 22:21:35,810 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-11 22:21:35,812 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-11 22:21:35,813 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-11 22:21:35,816 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-11 22:21:35,817 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-11 22:21:35,818 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-11 22:21:35,819 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-11 22:21:35,824 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-11 22:21:35,826 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-11 22:21:35,827 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-11 22:21:35,828 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-11 22:21:35,828 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-11 22:21:35,830 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-11 22:21:35,836 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-11 22:21:35,836 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-11 22:21:35,836 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-11 22:21:35,838 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-11 22:21:35,838 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-11 22:21:35,839 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-11 22:21:35,839 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-11 22:21:35,841 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-11 22:21:35,841 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-11 22:21:35,842 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-11 22:21:35,843 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-11 22:21:35,843 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-11 22:21:35,843 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-11 22:21:35,844 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-11 22:21:35,844 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-11 22:21:35,844 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-11 22:21:35,846 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-11 22:21:35,847 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-11 22:21:35,877 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-11 22:21:35,877 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-11 22:21:35,878 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-11 22:21:35,878 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-11 22:21:35,879 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-11 22:21:35,880 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-11 22:21:35,880 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-11 22:21:35,880 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-11 22:21:35,880 INFO L138 SettingsManager]: * Use SBE=true [2022-07-11 22:21:35,881 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-11 22:21:35,881 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-11 22:21:35,882 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-11 22:21:35,882 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-11 22:21:35,882 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-11 22:21:35,882 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-11 22:21:35,882 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-11 22:21:35,883 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-11 22:21:35,883 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-11 22:21:35,883 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-11 22:21:35,884 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-11 22:21:35,884 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-11 22:21:35,884 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-11 22:21:35,885 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-11 22:21:35,885 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-11 22:21:35,885 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 22:21:35,885 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-11 22:21:35,885 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-11 22:21:35,886 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-11 22:21:35,886 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-11 22:21:35,886 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-11 22:21:35,886 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-11 22:21:35,886 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-11 22:21:35,887 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-11 22:21:35,887 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 -> a98ea70d5d9f752732070144a56514c68e9571f139726211e2f0ade721d6c5f3 [2022-07-11 22:21:36,102 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-11 22:21:36,122 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-11 22:21:36,125 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-11 22:21:36,126 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-11 22:21:36,127 INFO L275 PluginConnector]: CDTParser initialized [2022-07-11 22:21:36,128 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-tiling/mbpr2.c [2022-07-11 22:21:36,184 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25ad0f744/be5d5e3aa80b46b5b0a440cf14306621/FLAG8ad2853d1 [2022-07-11 22:21:36,550 INFO L306 CDTParser]: Found 1 translation units. [2022-07-11 22:21:36,551 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/mbpr2.c [2022-07-11 22:21:36,557 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25ad0f744/be5d5e3aa80b46b5b0a440cf14306621/FLAG8ad2853d1 [2022-07-11 22:21:36,976 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25ad0f744/be5d5e3aa80b46b5b0a440cf14306621 [2022-07-11 22:21:36,979 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-11 22:21:36,980 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-11 22:21:36,981 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-11 22:21:36,981 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-11 22:21:36,983 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-11 22:21:36,984 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 10:21:36" (1/1) ... [2022-07-11 22:21:36,985 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@647c6028 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:21:36, skipping insertion in model container [2022-07-11 22:21:36,985 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 10:21:36" (1/1) ... [2022-07-11 22:21:36,990 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-11 22:21:37,006 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-11 22:21:37,134 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-tiling/mbpr2.c[396,409] [2022-07-11 22:21:37,148 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 22:21:37,152 INFO L203 MainTranslator]: Completed pre-run [2022-07-11 22:21:37,161 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-tiling/mbpr2.c[396,409] [2022-07-11 22:21:37,169 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 22:21:37,179 INFO L208 MainTranslator]: Completed translation [2022-07-11 22:21:37,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:21:37 WrapperNode [2022-07-11 22:21:37,179 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-11 22:21:37,180 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-11 22:21:37,180 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-11 22:21:37,181 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-11 22:21:37,187 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:21:37" (1/1) ... [2022-07-11 22:21:37,192 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:21:37" (1/1) ... [2022-07-11 22:21:37,208 INFO L137 Inliner]: procedures = 15, calls = 22, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 83 [2022-07-11 22:21:37,209 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-11 22:21:37,209 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-11 22:21:37,209 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-11 22:21:37,210 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-11 22:21:37,216 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:21:37" (1/1) ... [2022-07-11 22:21:37,216 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:21:37" (1/1) ... [2022-07-11 22:21:37,218 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:21:37" (1/1) ... [2022-07-11 22:21:37,218 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:21:37" (1/1) ... [2022-07-11 22:21:37,223 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:21:37" (1/1) ... [2022-07-11 22:21:37,227 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:21:37" (1/1) ... [2022-07-11 22:21:37,228 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:21:37" (1/1) ... [2022-07-11 22:21:37,230 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-11 22:21:37,230 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-11 22:21:37,230 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-11 22:21:37,231 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-11 22:21:37,231 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:21:37" (1/1) ... [2022-07-11 22:21:37,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 22:21:37,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 22:21:37,260 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-11 22:21:37,286 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-11 22:21:37,308 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-11 22:21:37,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-11 22:21:37,309 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-11 22:21:37,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-11 22:21:37,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-11 22:21:37,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-11 22:21:37,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-11 22:21:37,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-11 22:21:37,359 INFO L234 CfgBuilder]: Building ICFG [2022-07-11 22:21:37,361 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-11 22:21:37,491 INFO L275 CfgBuilder]: Performing block encoding [2022-07-11 22:21:37,497 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-11 22:21:37,497 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-11 22:21:37,498 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 10:21:37 BoogieIcfgContainer [2022-07-11 22:21:37,499 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-11 22:21:37,500 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-11 22:21:37,500 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-11 22:21:37,503 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-11 22:21:37,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 10:21:36" (1/3) ... [2022-07-11 22:21:37,504 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19d822e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 10:21:37, skipping insertion in model container [2022-07-11 22:21:37,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:21:37" (2/3) ... [2022-07-11 22:21:37,504 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19d822e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 10:21:37, skipping insertion in model container [2022-07-11 22:21:37,505 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 10:21:37" (3/3) ... [2022-07-11 22:21:37,506 INFO L111 eAbstractionObserver]: Analyzing ICFG mbpr2.c [2022-07-11 22:21:37,517 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-11 22:21:37,518 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-11 22:21:37,564 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-11 22:21:37,581 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@79c89c23, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@61b1cfc9 [2022-07-11 22:21:37,593 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-11 22:21:37,597 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 28 states have internal predecessors, (41), 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-11 22:21:37,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-11 22:21:37,602 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:21:37,602 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 22:21:37,603 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:21:37,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:21:37,610 INFO L85 PathProgramCache]: Analyzing trace with hash -669443655, now seen corresponding path program 1 times [2022-07-11 22:21:37,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 22:21:37,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963381301] [2022-07-11 22:21:37,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:21:37,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 22:21:37,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:21:37,737 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-11 22:21:37,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 22:21:37,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963381301] [2022-07-11 22:21:37,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963381301] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 22:21:37,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 22:21:37,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-11 22:21:37,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315982324] [2022-07-11 22:21:37,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 22:21:37,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-11 22:21:37,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 22:21:37,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-11 22:21:37,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-11 22:21:37,787 INFO L87 Difference]: Start difference. First operand has 29 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 28 states have internal predecessors, (41), 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) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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-11 22:21:37,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 22:21:37,805 INFO L93 Difference]: Finished difference Result 53 states and 74 transitions. [2022-07-11 22:21:37,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-11 22:21:37,808 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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 15 [2022-07-11 22:21:37,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 22:21:37,813 INFO L225 Difference]: With dead ends: 53 [2022-07-11 22:21:37,814 INFO L226 Difference]: Without dead ends: 24 [2022-07-11 22:21:37,820 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-11 22:21:37,825 INFO L413 NwaCegarLoop]: 36 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, 36 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-11 22:21:37,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 22:21:37,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-07-11 22:21:37,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-07-11 22:21:37,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 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-11 22:21:37,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2022-07-11 22:21:37,856 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 15 [2022-07-11 22:21:37,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 22:21:37,857 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2022-07-11 22:21:37,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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-11 22:21:37,859 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2022-07-11 22:21:37,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-11 22:21:37,859 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:21:37,860 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 22:21:37,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-11 22:21:37,861 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:21:37,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:21:37,863 INFO L85 PathProgramCache]: Analyzing trace with hash -893920799, now seen corresponding path program 1 times [2022-07-11 22:21:37,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 22:21:37,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762387766] [2022-07-11 22:21:37,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:21:37,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 22:21:37,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:21:37,969 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-11 22:21:37,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 22:21:37,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762387766] [2022-07-11 22:21:37,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762387766] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 22:21:37,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 22:21:37,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 22:21:37,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796396544] [2022-07-11 22:21:37,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 22:21:37,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 22:21:37,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 22:21:37,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 22:21:37,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 22:21:37,974 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-11 22:21:38,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 22:21:38,025 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-07-11 22:21:38,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-11 22:21:38,026 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 15 [2022-07-11 22:21:38,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 22:21:38,026 INFO L225 Difference]: With dead ends: 33 [2022-07-11 22:21:38,026 INFO L226 Difference]: Without dead ends: 31 [2022-07-11 22:21:38,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 22:21:38,029 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 9 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 22:21:38,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 77 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 22:21:38,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-11 22:21:38,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2022-07-11 22:21:38,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 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-11 22:21:38,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2022-07-11 22:21:38,038 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 15 [2022-07-11 22:21:38,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 22:21:38,039 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2022-07-11 22:21:38,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-11 22:21:38,041 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-07-11 22:21:38,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-11 22:21:38,042 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:21:38,042 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 22:21:38,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-11 22:21:38,043 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:21:38,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:21:38,045 INFO L85 PathProgramCache]: Analyzing trace with hash -893861217, now seen corresponding path program 1 times [2022-07-11 22:21:38,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 22:21:38,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389386391] [2022-07-11 22:21:38,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:21:38,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 22:21:38,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:21:38,248 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-11 22:21:38,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 22:21:38,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389386391] [2022-07-11 22:21:38,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389386391] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 22:21:38,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 22:21:38,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-11 22:21:38,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292410694] [2022-07-11 22:21:38,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 22:21:38,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-11 22:21:38,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 22:21:38,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-11 22:21:38,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-11 22:21:38,253 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-11 22:21:38,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 22:21:38,337 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-07-11 22:21:38,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-11 22:21:38,337 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 15 [2022-07-11 22:21:38,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 22:21:38,338 INFO L225 Difference]: With dead ends: 50 [2022-07-11 22:21:38,338 INFO L226 Difference]: Without dead ends: 34 [2022-07-11 22:21:38,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-11 22:21:38,339 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 56 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 22:21:38,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 22 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 22:21:38,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-11 22:21:38,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2022-07-11 22:21:38,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 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-11 22:21:38,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2022-07-11 22:21:38,347 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 15 [2022-07-11 22:21:38,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 22:21:38,348 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2022-07-11 22:21:38,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-11 22:21:38,348 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2022-07-11 22:21:38,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-11 22:21:38,350 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:21:38,351 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 22:21:38,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-11 22:21:38,351 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:21:38,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:21:38,353 INFO L85 PathProgramCache]: Analyzing trace with hash -815951211, now seen corresponding path program 1 times [2022-07-11 22:21:38,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 22:21:38,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203183972] [2022-07-11 22:21:38,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:21:38,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 22:21:38,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:21:38,411 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-11 22:21:38,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 22:21:38,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203183972] [2022-07-11 22:21:38,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203183972] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 22:21:38,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 22:21:38,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 22:21:38,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732241046] [2022-07-11 22:21:38,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 22:21:38,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 22:21:38,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 22:21:38,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 22:21:38,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 22:21:38,417 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-11 22:21:38,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 22:21:38,432 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2022-07-11 22:21:38,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 22:21:38,434 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 23 [2022-07-11 22:21:38,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 22:21:38,435 INFO L225 Difference]: With dead ends: 43 [2022-07-11 22:21:38,435 INFO L226 Difference]: Without dead ends: 28 [2022-07-11 22:21:38,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 22:21:38,437 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 15 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 22:21:38,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 25 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 22:21:38,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-07-11 22:21:38,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-07-11 22:21:38,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 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-11 22:21:38,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-07-11 22:21:38,442 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 23 [2022-07-11 22:21:38,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 22:21:38,443 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-07-11 22:21:38,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-11 22:21:38,443 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-07-11 22:21:38,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-11 22:21:38,444 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:21:38,444 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 22:21:38,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-11 22:21:38,445 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:21:38,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:21:38,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1208978221, now seen corresponding path program 1 times [2022-07-11 22:21:38,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 22:21:38,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136871781] [2022-07-11 22:21:38,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:21:38,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 22:21:38,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:21:38,776 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 22:21:38,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 22:21:38,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136871781] [2022-07-11 22:21:38,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136871781] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 22:21:38,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [864084900] [2022-07-11 22:21:38,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:21:38,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:21:38,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 22:21:38,787 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-11 22:21:38,789 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-11 22:21:38,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:21:38,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-11 22:21:38,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 22:21:38,971 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-11 22:21:39,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:21:39,023 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-11 22:21:39,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:21:39,096 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2022-07-11 22:21:39,126 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-07-11 22:21:39,189 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-11 22:21:39,226 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 22:21:39,227 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 22:21:39,360 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2022-07-11 22:21:39,364 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2022-07-11 22:21:39,414 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-11 22:21:39,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [864084900] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 22:21:39,416 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 22:21:39,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 18 [2022-07-11 22:21:39,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962842754] [2022-07-11 22:21:39,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 22:21:39,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-11 22:21:39,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 22:21:39,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-11 22:21:39,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2022-07-11 22:21:39,422 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 18 states have internal predecessors, (58), 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-11 22:21:39,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 22:21:39,656 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2022-07-11 22:21:39,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-11 22:21:39,657 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 18 states have internal predecessors, (58), 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 23 [2022-07-11 22:21:39,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 22:21:39,660 INFO L225 Difference]: With dead ends: 73 [2022-07-11 22:21:39,660 INFO L226 Difference]: Without dead ends: 52 [2022-07-11 22:21:39,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=410, Unknown=0, NotChecked=0, Total=552 [2022-07-11 22:21:39,665 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 153 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 22:21:39,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 76 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 22:21:39,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-07-11 22:21:39,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 30. [2022-07-11 22:21:39,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 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-11 22:21:39,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-07-11 22:21:39,674 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 23 [2022-07-11 22:21:39,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 22:21:39,674 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-07-11 22:21:39,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 18 states have internal predecessors, (58), 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-11 22:21:39,675 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-07-11 22:21:39,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-11 22:21:39,675 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:21:39,676 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 22:21:39,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-11 22:21:39,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:21:39,877 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:21:39,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:21:39,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1368311994, now seen corresponding path program 1 times [2022-07-11 22:21:39,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 22:21:39,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309027073] [2022-07-11 22:21:39,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:21:39,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 22:21:39,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:21:39,993 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 22:21:39,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 22:21:39,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309027073] [2022-07-11 22:21:39,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309027073] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 22:21:39,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [356504248] [2022-07-11 22:21:39,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:21:39,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:21:39,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 22:21:39,996 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-11 22:21:40,015 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-11 22:21:40,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:21:40,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-11 22:21:40,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 22:21:40,065 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-11 22:21:40,081 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-07-11 22:21:40,082 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-07-11 22:21:40,136 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-11 22:21:40,136 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 22:21:40,198 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2022-07-11 22:21:40,200 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2022-07-11 22:21:40,205 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-11 22:21:40,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [356504248] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 22:21:40,205 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 22:21:40,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 11 [2022-07-11 22:21:40,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454544170] [2022-07-11 22:21:40,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 22:21:40,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-11 22:21:40,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 22:21:40,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-11 22:21:40,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-07-11 22:21:40,207 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 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-11 22:21:40,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 22:21:40,416 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2022-07-11 22:21:40,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-11 22:21:40,416 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 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 29 [2022-07-11 22:21:40,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 22:21:40,417 INFO L225 Difference]: With dead ends: 56 [2022-07-11 22:21:40,417 INFO L226 Difference]: Without dead ends: 54 [2022-07-11 22:21:40,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 51 SyntacticMatches, 8 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2022-07-11 22:21:40,418 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 56 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 22:21:40,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 91 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 22:21:40,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-07-11 22:21:40,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 36. [2022-07-11 22:21:40,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 states have internal predecessors, (40), 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-11 22:21:40,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2022-07-11 22:21:40,424 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 29 [2022-07-11 22:21:40,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 22:21:40,424 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2022-07-11 22:21:40,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 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-11 22:21:40,425 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2022-07-11 22:21:40,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-11 22:21:40,425 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:21:40,426 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 22:21:40,451 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-11 22:21:40,648 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,SelfDestructingSolverStorable5 [2022-07-11 22:21:40,649 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:21:40,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:21:40,649 INFO L85 PathProgramCache]: Analyzing trace with hash 21305209, now seen corresponding path program 2 times [2022-07-11 22:21:40,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 22:21:40,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918704891] [2022-07-11 22:21:40,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:21:40,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 22:21:40,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:21:40,894 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-11 22:21:40,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 22:21:40,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918704891] [2022-07-11 22:21:40,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918704891] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 22:21:40,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [671791298] [2022-07-11 22:21:40,895 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-11 22:21:40,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:21:40,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 22:21:40,896 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-11 22:21:40,938 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-11 22:21:40,963 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-11 22:21:40,963 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 22:21:40,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-11 22:21:40,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 22:21:41,224 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-11 22:21:41,225 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 22:21:41,351 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-11 22:21:41,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [671791298] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 22:21:41,352 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 22:21:41,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 25 [2022-07-11 22:21:41,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153176297] [2022-07-11 22:21:41,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 22:21:41,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-11 22:21:41,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 22:21:41,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-11 22:21:41,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=442, Unknown=0, NotChecked=0, Total=600 [2022-07-11 22:21:41,354 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 25 states, 25 states have (on average 3.72) internal successors, (93), 25 states have internal predecessors, (93), 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-11 22:21:41,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 22:21:41,601 INFO L93 Difference]: Finished difference Result 97 states and 108 transitions. [2022-07-11 22:21:41,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-11 22:21:41,602 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.72) internal successors, (93), 25 states have internal predecessors, (93), 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 35 [2022-07-11 22:21:41,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 22:21:41,603 INFO L225 Difference]: With dead ends: 97 [2022-07-11 22:21:41,603 INFO L226 Difference]: Without dead ends: 54 [2022-07-11 22:21:41,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=251, Invalid=619, Unknown=0, NotChecked=0, Total=870 [2022-07-11 22:21:41,604 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 335 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 22:21:41,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 81 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 22:21:41,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-07-11 22:21:41,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 44. [2022-07-11 22:21:41,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 43 states have internal predecessors, (48), 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-11 22:21:41,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2022-07-11 22:21:41,610 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 35 [2022-07-11 22:21:41,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 22:21:41,611 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2022-07-11 22:21:41,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.72) internal successors, (93), 25 states have internal predecessors, (93), 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-11 22:21:41,611 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2022-07-11 22:21:41,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-11 22:21:41,612 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:21:41,612 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 22:21:41,636 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-11 22:21:41,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:21:41,828 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:21:41,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:21:41,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1279882925, now seen corresponding path program 3 times [2022-07-11 22:21:41,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 22:21:41,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197272324] [2022-07-11 22:21:41,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:21:41,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 22:21:41,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:21:41,973 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-11 22:21:41,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 22:21:41,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197272324] [2022-07-11 22:21:41,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197272324] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 22:21:41,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496984113] [2022-07-11 22:21:41,973 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-11 22:21:41,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:21:41,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 22:21:41,975 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-11 22:21:41,976 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-11 22:21:42,068 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-11 22:21:42,068 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 22:21:42,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-11 22:21:42,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 22:21:42,134 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-11 22:21:42,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:21:42,165 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2022-07-11 22:21:42,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:21:42,200 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2022-07-11 22:21:42,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:21:42,213 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2022-07-11 22:21:42,305 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-11 22:21:42,322 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-11 22:21:42,322 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 22:21:44,439 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_52| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_52|)) (forall ((v_ArrVal_129 Int)) (< (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_52| 8) (- 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_129) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4)) |c_ULTIMATE.start_main_~MINVAL~0#1|)))) is different from false [2022-07-11 22:21:44,942 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2022-07-11 22:21:44,946 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 856 treesize of output 840 [2022-07-11 22:21:45,307 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 1 not checked. [2022-07-11 22:21:45,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496984113] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 22:21:45,308 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 22:21:45,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 11] total 25 [2022-07-11 22:21:45,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111391075] [2022-07-11 22:21:45,308 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 22:21:45,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-11 22:21:45,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 22:21:45,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-11 22:21:45,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=443, Unknown=2, NotChecked=44, Total=600 [2022-07-11 22:21:45,310 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand has 25 states, 25 states have (on average 3.88) internal successors, (97), 25 states have internal predecessors, (97), 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-11 22:21:47,425 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) (- 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) .cse1))) (and (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| 0) (= (+ (- 2) |c_ULTIMATE.start_main_~MINVAL~0#1|) 0) (= .cse0 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_52| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_52|)) (forall ((v_ArrVal_129 Int)) (< (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_52| 8) (- 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_129) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4)) |c_ULTIMATE.start_main_~MINVAL~0#1|)))) (<= 2 |c_ULTIMATE.start_main_~MINVAL~0#1|) (= (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4) .cse1) (<= .cse0 0) (= |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2022-07-11 22:21:49,460 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) .cse0))) (and (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| 0) (= (+ (- 2) |c_ULTIMATE.start_main_~MINVAL~0#1|) 0) (<= 2 |c_ULTIMATE.start_main_~i~0#1|) (not (= .cse0 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) (- 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset|))) (forall ((|v_ULTIMATE.start_main_~i~0#1_52| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_52|)) (forall ((v_ArrVal_129 Int)) (< (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_52| 8) (- 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_129) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4)) |c_ULTIMATE.start_main_~MINVAL~0#1|)))) (<= .cse1 0) (<= 2 |c_ULTIMATE.start_main_~MINVAL~0#1|) (= .cse1 0)))) is different from false [2022-07-11 22:21:49,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 22:21:49,635 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2022-07-11 22:21:49,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-11 22:21:49,636 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.88) internal successors, (97), 25 states have internal predecessors, (97), 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 43 [2022-07-11 22:21:49,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 22:21:49,637 INFO L225 Difference]: With dead ends: 65 [2022-07-11 22:21:49,637 INFO L226 Difference]: Without dead ends: 55 [2022-07-11 22:21:49,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 76 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=238, Invalid=826, Unknown=4, NotChecked=192, Total=1260 [2022-07-11 22:21:49,649 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 77 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 63 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 22:21:49,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 122 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 206 Invalid, 0 Unknown, 63 Unchecked, 0.1s Time] [2022-07-11 22:21:49,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-07-11 22:21:49,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 44. [2022-07-11 22:21:49,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 43 states have internal predecessors, (47), 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-11 22:21:49,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2022-07-11 22:21:49,654 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 43 [2022-07-11 22:21:49,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 22:21:49,655 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2022-07-11 22:21:49,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.88) internal successors, (97), 25 states have internal predecessors, (97), 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-11 22:21:49,656 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2022-07-11 22:21:49,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-11 22:21:49,657 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:21:49,657 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 22:21:49,664 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-07-11 22:21:49,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:21:49,862 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:21:49,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:21:49,863 INFO L85 PathProgramCache]: Analyzing trace with hash 886855915, now seen corresponding path program 4 times [2022-07-11 22:21:49,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 22:21:49,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871767183] [2022-07-11 22:21:49,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:21:49,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 22:21:49,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:21:50,255 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-11 22:21:50,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 22:21:50,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871767183] [2022-07-11 22:21:50,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871767183] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 22:21:50,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803390611] [2022-07-11 22:21:50,256 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-11 22:21:50,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:21:50,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 22:21:50,257 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 22:21:50,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-11 22:21:50,316 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-11 22:21:50,316 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 22:21:50,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-11 22:21:50,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 22:21:50,411 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-11 22:21:50,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:21:50,436 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-11 22:21:50,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:21:50,493 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2022-07-11 22:21:50,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:21:50,509 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2022-07-11 22:21:50,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:21:50,541 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2022-07-11 22:21:50,549 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2022-07-11 22:21:50,691 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-11 22:21:50,708 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 22:21:50,709 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 22:21:50,916 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2022-07-11 22:21:50,919 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2022-07-11 22:21:50,987 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-11 22:21:50,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [803390611] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 22:21:50,987 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 22:21:50,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 27 [2022-07-11 22:21:50,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44635215] [2022-07-11 22:21:50,988 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 22:21:50,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-11 22:21:50,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 22:21:50,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-11 22:21:50,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=591, Unknown=0, NotChecked=0, Total=702 [2022-07-11 22:21:50,989 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand has 27 states, 27 states have (on average 4.296296296296297) internal successors, (116), 27 states have internal predecessors, (116), 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-11 22:21:51,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 22:21:51,339 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2022-07-11 22:21:51,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-11 22:21:51,340 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 4.296296296296297) internal successors, (116), 27 states have internal predecessors, (116), 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 43 [2022-07-11 22:21:51,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 22:21:51,340 INFO L225 Difference]: With dead ends: 71 [2022-07-11 22:21:51,340 INFO L226 Difference]: Without dead ends: 61 [2022-07-11 22:21:51,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 67 SyntacticMatches, 14 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 430 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=213, Invalid=909, Unknown=0, NotChecked=0, Total=1122 [2022-07-11 22:21:51,341 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 169 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 33 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 22:21:51,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 142 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 331 Invalid, 0 Unknown, 33 Unchecked, 0.2s Time] [2022-07-11 22:21:51,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-07-11 22:21:51,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 50. [2022-07-11 22:21:51,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 49 states have internal predecessors, (53), 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-11 22:21:51,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2022-07-11 22:21:51,348 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 43 [2022-07-11 22:21:51,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 22:21:51,348 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2022-07-11 22:21:51,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 4.296296296296297) internal successors, (116), 27 states have internal predecessors, (116), 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-11 22:21:51,348 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2022-07-11 22:21:51,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-11 22:21:51,349 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:21:51,349 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 22:21:51,376 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-11 22:21:51,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:21:51,575 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:21:51,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:21:51,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1854428834, now seen corresponding path program 5 times [2022-07-11 22:21:51,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 22:21:51,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250216574] [2022-07-11 22:21:51,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:21:51,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 22:21:51,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:21:51,919 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 22:21:51,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 22:21:51,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250216574] [2022-07-11 22:21:51,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250216574] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 22:21:51,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417260819] [2022-07-11 22:21:51,920 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-11 22:21:51,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:21:51,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 22:21:51,924 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 22:21:51,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-11 22:21:52,003 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-07-11 22:21:52,004 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 22:21:52,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-11 22:21:52,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 22:21:52,031 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-11 22:21:52,051 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-11 22:21:52,051 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-07-11 22:21:52,204 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-11 22:21:52,204 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 22:21:52,309 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2022-07-11 22:21:52,310 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2022-07-11 22:21:52,342 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-11 22:21:52,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1417260819] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 22:21:52,343 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 22:21:52,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11, 11] total 29 [2022-07-11 22:21:52,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182604079] [2022-07-11 22:21:52,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 22:21:52,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-11 22:21:52,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 22:21:52,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-11 22:21:52,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=696, Unknown=0, NotChecked=0, Total=812 [2022-07-11 22:21:52,347 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 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-11 22:21:53,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 22:21:53,460 INFO L93 Difference]: Finished difference Result 174 states and 191 transitions. [2022-07-11 22:21:53,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-07-11 22:21:53,460 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 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 49 [2022-07-11 22:21:53,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 22:21:53,461 INFO L225 Difference]: With dead ends: 174 [2022-07-11 22:21:53,461 INFO L226 Difference]: Without dead ends: 145 [2022-07-11 22:21:53,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 81 SyntacticMatches, 7 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1628 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=800, Invalid=4312, Unknown=0, NotChecked=0, Total=5112 [2022-07-11 22:21:53,463 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 356 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-11 22:21:53,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 208 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-11 22:21:53,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-07-11 22:21:53,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 70. [2022-07-11 22:21:53,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.0869565217391304) internal successors, (75), 69 states have internal predecessors, (75), 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-11 22:21:53,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2022-07-11 22:21:53,473 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 49 [2022-07-11 22:21:53,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 22:21:53,474 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2022-07-11 22:21:53,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 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-11 22:21:53,474 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2022-07-11 22:21:53,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-11 22:21:53,475 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:21:53,475 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 22:21:53,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-11 22:21:53,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:21:53,699 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:21:53,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:21:53,699 INFO L85 PathProgramCache]: Analyzing trace with hash -2084333679, now seen corresponding path program 6 times [2022-07-11 22:21:53,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 22:21:53,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243834268] [2022-07-11 22:21:53,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:21:53,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 22:21:53,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:21:53,970 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 33 proven. 25 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-11 22:21:53,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 22:21:53,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243834268] [2022-07-11 22:21:53,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243834268] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 22:21:53,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005528805] [2022-07-11 22:21:53,970 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-11 22:21:53,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:21:53,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 22:21:53,976 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 22:21:54,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-11 22:21:54,068 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-07-11 22:21:54,068 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 22:21:54,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-11 22:21:54,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 22:21:54,451 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 52 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-11 22:21:54,452 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 22:21:54,629 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 52 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-11 22:21:54,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1005528805] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 22:21:54,630 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 22:21:54,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 12] total 33 [2022-07-11 22:21:54,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099516701] [2022-07-11 22:21:54,630 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 22:21:54,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-11 22:21:54,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 22:21:54,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-11 22:21:54,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=793, Unknown=0, NotChecked=0, Total=1056 [2022-07-11 22:21:54,632 INFO L87 Difference]: Start difference. First operand 70 states and 75 transitions. Second operand has 33 states, 33 states have (on average 4.242424242424242) internal successors, (140), 33 states have internal predecessors, (140), 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-11 22:21:54,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 22:21:54,938 INFO L93 Difference]: Finished difference Result 117 states and 125 transitions. [2022-07-11 22:21:54,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-11 22:21:54,939 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 4.242424242424242) internal successors, (140), 33 states have internal predecessors, (140), 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 55 [2022-07-11 22:21:54,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 22:21:54,939 INFO L225 Difference]: With dead ends: 117 [2022-07-11 22:21:54,939 INFO L226 Difference]: Without dead ends: 70 [2022-07-11 22:21:54,940 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 89 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=418, Invalid=1142, Unknown=0, NotChecked=0, Total=1560 [2022-07-11 22:21:54,941 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 376 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 22:21:54,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 167 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 22:21:54,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-07-11 22:21:54,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 64. [2022-07-11 22:21:54,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.0793650793650793) internal successors, (68), 63 states have internal predecessors, (68), 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-11 22:21:54,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2022-07-11 22:21:54,948 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 55 [2022-07-11 22:21:54,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 22:21:54,948 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2022-07-11 22:21:54,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 4.242424242424242) internal successors, (140), 33 states have internal predecessors, (140), 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-11 22:21:54,949 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2022-07-11 22:21:54,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-11 22:21:54,949 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:21:54,950 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 22:21:54,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-11 22:21:55,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:21:55,155 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:21:55,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:21:55,156 INFO L85 PathProgramCache]: Analyzing trace with hash 419308485, now seen corresponding path program 7 times [2022-07-11 22:21:55,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 22:21:55,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210936241] [2022-07-11 22:21:55,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:21:55,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 22:21:55,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:21:55,794 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 26 proven. 54 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-11 22:21:55,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 22:21:55,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210936241] [2022-07-11 22:21:55,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210936241] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 22:21:55,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370103840] [2022-07-11 22:21:55,795 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-11 22:21:55,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:21:55,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 22:21:55,800 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 22:21:55,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-11 22:21:55,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:21:55,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-11 22:21:55,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 22:21:55,938 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-11 22:21:55,971 INFO L356 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2022-07-11 22:21:55,972 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2022-07-11 22:21:56,017 INFO L356 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2022-07-11 22:21:56,018 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 25 [2022-07-11 22:21:56,030 INFO L356 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2022-07-11 22:21:56,030 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 25 [2022-07-11 22:21:56,203 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-11 22:21:56,225 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 26 proven. 39 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-11 22:21:56,226 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 22:21:58,404 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_111| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_111|)) (forall ((v_ArrVal_314 Int)) (< (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_111|) (- 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_314) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 12)) |c_ULTIMATE.start_main_~MINVAL~0#1|)))) is different from false [2022-07-11 22:22:01,391 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2022-07-11 22:22:01,395 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 196 treesize of output 192 [2022-07-11 22:22:01,506 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 26 proven. 37 refuted. 0 times theorem prover too weak. 17 trivial. 2 not checked. [2022-07-11 22:22:01,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1370103840] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 22:22:01,507 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 22:22:01,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12, 14] total 40 [2022-07-11 22:22:01,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030176982] [2022-07-11 22:22:01,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 22:22:01,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-07-11 22:22:01,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 22:22:01,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-11 22:22:01,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=1255, Unknown=8, NotChecked=74, Total=1560 [2022-07-11 22:22:01,509 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand has 40 states, 40 states have (on average 3.725) internal successors, (149), 40 states have internal predecessors, (149), 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-11 22:22:03,968 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|)) (.cse3 (= 2 |c_ULTIMATE.start_main_~MINVAL~0#1|)) (.cse1 (* 8 |c_ULTIMATE.start_main_~i~0#1|)) (.cse0 (div c_~CELLCOUNT~0 2))) (and (<= (+ (div (+ (* (- 1) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) 16) 8) 1) .cse0) (<= (+ .cse1 |c_ULTIMATE.start_main_~#volArray~0#1.offset|) 16) (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_111| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_111|)) (forall ((v_ArrVal_314 Int)) (< (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_111|) (- 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_314) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 12)) |c_ULTIMATE.start_main_~MINVAL~0#1|)))) (= (+ (- 2) |c_ULTIMATE.start_main_~MINVAL~0#1|) 0) (<= 2 |c_ULTIMATE.start_main_~i~0#1|) (= (select .cse2 12) 0) .cse3 (<= |c_ULTIMATE.start_main_~i~0#1| 2) (let ((.cse4 (+ .cse1 (- 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset|))) (or (not (= .cse4 12)) (and (= (select .cse2 .cse4) 0) .cse3))) (<= 3 .cse0))) is different from false [2022-07-11 22:22:06,092 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|))) (and (<= 3 |c_ULTIMATE.start_main_~i~0#1|) (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_111| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_111|)) (forall ((v_ArrVal_314 Int)) (< (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_111|) (- 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_314) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 12)) |c_ULTIMATE.start_main_~MINVAL~0#1|)))) (<= (select .cse0 (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 12)) 0) (<= 2 |c_ULTIMATE.start_main_~MINVAL~0#1|) (let ((.cse3 (div c_~CELLCOUNT~0 2))) (let ((.cse2 (* .cse3 8)) (.cse1 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (or (and (<= (+ .cse1 |c_ULTIMATE.start_main_~#volArray~0#1.offset|) (+ .cse2 7)) (not (= (+ c_~CELLCOUNT~0 (* .cse3 (- 2))) 0)) (not (<= 0 c_~CELLCOUNT~0))) (<= (+ .cse1 |c_ULTIMATE.start_main_~#volArray~0#1.offset| 1) .cse2) (and (= (+ (- 2) |c_ULTIMATE.start_main_~MINVAL~0#1|) 0) (= (select .cse0 12) 0) (not (= (+ .cse1 (- 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) 12)))))))) is different from false [2022-07-11 22:22:06,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 22:22:06,483 INFO L93 Difference]: Finished difference Result 153 states and 164 transitions. [2022-07-11 22:22:06,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-11 22:22:06,484 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 3.725) internal successors, (149), 40 states have internal predecessors, (149), 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 63 [2022-07-11 22:22:06,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 22:22:06,484 INFO L225 Difference]: With dead ends: 153 [2022-07-11 22:22:06,485 INFO L226 Difference]: Without dead ends: 143 [2022-07-11 22:22:06,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 112 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1103 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=437, Invalid=2645, Unknown=10, NotChecked=330, Total=3422 [2022-07-11 22:22:06,486 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 235 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 1044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 186 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-11 22:22:06,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 467 Invalid, 1044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 763 Invalid, 0 Unknown, 186 Unchecked, 0.4s Time] [2022-07-11 22:22:06,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-07-11 22:22:06,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 93. [2022-07-11 22:22:06,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 1.076086956521739) internal successors, (99), 92 states have internal predecessors, (99), 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-11 22:22:06,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 99 transitions. [2022-07-11 22:22:06,497 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 99 transitions. Word has length 63 [2022-07-11 22:22:06,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 22:22:06,497 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 99 transitions. [2022-07-11 22:22:06,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 3.725) internal successors, (149), 40 states have internal predecessors, (149), 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-11 22:22:06,498 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 99 transitions. [2022-07-11 22:22:06,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-11 22:22:06,498 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:22:06,498 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 22:22:06,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-11 22:22:06,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-11 22:22:06,720 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:22:06,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:22:06,720 INFO L85 PathProgramCache]: Analyzing trace with hash 26281475, now seen corresponding path program 8 times [2022-07-11 22:22:06,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 22:22:06,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135239073] [2022-07-11 22:22:06,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:22:06,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 22:22:06,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:22:07,524 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 8 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 22:22:07,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 22:22:07,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135239073] [2022-07-11 22:22:07,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135239073] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 22:22:07,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940929564] [2022-07-11 22:22:07,524 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-11 22:22:07,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:22:07,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 22:22:07,525 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 22:22:07,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-11 22:22:07,596 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-11 22:22:07,596 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 22:22:07,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 56 conjunts are in the unsatisfiable core [2022-07-11 22:22:07,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 22:22:07,757 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-11 22:22:07,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:22:07,794 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-11 22:22:07,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:22:07,867 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2022-07-11 22:22:07,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:22:07,886 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2022-07-11 22:22:07,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:22:07,931 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2022-07-11 22:22:07,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:22:07,944 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2022-07-11 22:22:07,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:22:07,985 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2022-07-11 22:22:08,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:22:08,025 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-11 22:22:08,025 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 25 [2022-07-11 22:22:08,447 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 8 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 22:22:08,447 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 22:22:09,097 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2022-07-11 22:22:09,100 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 59 [2022-07-11 22:22:09,335 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-11 22:22:09,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [940929564] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 22:22:09,335 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 22:22:09,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 18] total 50 [2022-07-11 22:22:09,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146414411] [2022-07-11 22:22:09,336 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 22:22:09,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-11 22:22:09,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 22:22:09,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-11 22:22:09,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=2233, Unknown=0, NotChecked=0, Total=2450 [2022-07-11 22:22:09,338 INFO L87 Difference]: Start difference. First operand 93 states and 99 transitions. Second operand has 50 states, 50 states have (on average 3.6) internal successors, (180), 50 states have internal predecessors, (180), 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-11 22:22:12,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 22:22:12,239 INFO L93 Difference]: Finished difference Result 192 states and 209 transitions. [2022-07-11 22:22:12,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-07-11 22:22:12,240 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 3.6) internal successors, (180), 50 states have internal predecessors, (180), 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 63 [2022-07-11 22:22:12,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 22:22:12,241 INFO L225 Difference]: With dead ends: 192 [2022-07-11 22:22:12,241 INFO L226 Difference]: Without dead ends: 182 [2022-07-11 22:22:12,243 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 101 SyntacticMatches, 9 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3961 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1225, Invalid=11657, Unknown=0, NotChecked=0, Total=12882 [2022-07-11 22:22:12,244 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 361 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 1577 mSolverCounterSat, 231 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 2090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 231 IncrementalHoareTripleChecker+Valid, 1577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 282 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-11 22:22:12,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 603 Invalid, 2090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [231 Valid, 1577 Invalid, 0 Unknown, 282 Unchecked, 0.8s Time] [2022-07-11 22:22:12,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-07-11 22:22:12,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 126. [2022-07-11 22:22:12,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 1.064) internal successors, (133), 125 states have internal predecessors, (133), 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-11 22:22:12,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 133 transitions. [2022-07-11 22:22:12,256 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 133 transitions. Word has length 63 [2022-07-11 22:22:12,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 22:22:12,256 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 133 transitions. [2022-07-11 22:22:12,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 3.6) internal successors, (180), 50 states have internal predecessors, (180), 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-11 22:22:12,257 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 133 transitions. [2022-07-11 22:22:12,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-07-11 22:22:12,258 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:22:12,258 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 22:22:12,276 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-07-11 22:22:12,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-11 22:22:12,468 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:22:12,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:22:12,468 INFO L85 PathProgramCache]: Analyzing trace with hash 234543151, now seen corresponding path program 9 times [2022-07-11 22:22:12,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 22:22:12,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476220114] [2022-07-11 22:22:12,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:22:12,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 22:22:12,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:22:12,608 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 19 proven. 24 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-07-11 22:22:12,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 22:22:12,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476220114] [2022-07-11 22:22:12,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476220114] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 22:22:12,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215929201] [2022-07-11 22:22:12,609 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-11 22:22:12,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:22:12,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 22:22:12,612 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 22:22:12,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-11 22:22:12,793 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-07-11 22:22:12,794 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 22:22:12,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-11 22:22:12,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 22:22:12,907 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 28 proven. 15 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-07-11 22:22:12,907 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 22:22:13,108 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 28 proven. 15 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-07-11 22:22:13,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [215929201] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 22:22:13,109 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 22:22:13,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-07-11 22:22:13,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107602036] [2022-07-11 22:22:13,110 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 22:22:13,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-11 22:22:13,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 22:22:13,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-11 22:22:13,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-07-11 22:22:13,111 INFO L87 Difference]: Start difference. First operand 126 states and 133 transitions. Second operand has 17 states, 17 states have (on average 4.176470588235294) internal successors, (71), 17 states have internal predecessors, (71), 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-11 22:22:13,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 22:22:13,331 INFO L93 Difference]: Finished difference Result 230 states and 246 transitions. [2022-07-11 22:22:13,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-11 22:22:13,333 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.176470588235294) internal successors, (71), 17 states have internal predecessors, (71), 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 73 [2022-07-11 22:22:13,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 22:22:13,333 INFO L225 Difference]: With dead ends: 230 [2022-07-11 22:22:13,333 INFO L226 Difference]: Without dead ends: 164 [2022-07-11 22:22:13,334 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 136 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=156, Invalid=444, Unknown=0, NotChecked=0, Total=600 [2022-07-11 22:22:13,335 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 154 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 22:22:13,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 87 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 22:22:13,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-07-11 22:22:13,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 144. [2022-07-11 22:22:13,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 143 states have (on average 1.062937062937063) internal successors, (152), 143 states have internal predecessors, (152), 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-11 22:22:13,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 152 transitions. [2022-07-11 22:22:13,350 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 152 transitions. Word has length 73 [2022-07-11 22:22:13,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 22:22:13,350 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 152 transitions. [2022-07-11 22:22:13,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.176470588235294) internal successors, (71), 17 states have internal predecessors, (71), 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-11 22:22:13,350 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 152 transitions. [2022-07-11 22:22:13,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-07-11 22:22:13,351 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:22:13,351 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 22:22:13,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-11 22:22:13,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-11 22:22:13,559 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:22:13,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:22:13,560 INFO L85 PathProgramCache]: Analyzing trace with hash -903520087, now seen corresponding path program 10 times [2022-07-11 22:22:13,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 22:22:13,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091991132] [2022-07-11 22:22:13,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:22:13,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 22:22:13,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:22:13,891 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 83 proven. 46 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-11 22:22:13,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 22:22:13,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091991132] [2022-07-11 22:22:13,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091991132] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 22:22:13,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63027364] [2022-07-11 22:22:13,891 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-11 22:22:13,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:22:13,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 22:22:13,892 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 22:22:13,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-11 22:22:13,969 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-11 22:22:13,969 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 22:22:13,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-11 22:22:13,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 22:22:14,452 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 114 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-11 22:22:14,452 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 22:22:14,679 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 114 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-11 22:22:14,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [63027364] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 22:22:14,679 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 22:22:14,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 15] total 42 [2022-07-11 22:22:14,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921602236] [2022-07-11 22:22:14,679 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 22:22:14,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-07-11 22:22:14,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 22:22:14,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-11 22:22:14,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=412, Invalid=1310, Unknown=0, NotChecked=0, Total=1722 [2022-07-11 22:22:14,681 INFO L87 Difference]: Start difference. First operand 144 states and 152 transitions. Second operand has 42 states, 42 states have (on average 4.476190476190476) internal successors, (188), 42 states have internal predecessors, (188), 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-11 22:22:14,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 22:22:14,992 INFO L93 Difference]: Finished difference Result 169 states and 179 transitions. [2022-07-11 22:22:14,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-11 22:22:14,993 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 4.476190476190476) internal successors, (188), 42 states have internal predecessors, (188), 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 75 [2022-07-11 22:22:14,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 22:22:14,993 INFO L225 Difference]: With dead ends: 169 [2022-07-11 22:22:14,993 INFO L226 Difference]: Without dead ends: 106 [2022-07-11 22:22:14,994 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 123 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 866 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=618, Invalid=1832, Unknown=0, NotChecked=0, Total=2450 [2022-07-11 22:22:14,994 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 448 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 22:22:14,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 173 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 22:22:14,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-07-11 22:22:15,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 103. [2022-07-11 22:22:15,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 102 states have (on average 1.0686274509803921) internal successors, (109), 102 states have internal predecessors, (109), 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-11 22:22:15,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 109 transitions. [2022-07-11 22:22:15,003 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 109 transitions. Word has length 75 [2022-07-11 22:22:15,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 22:22:15,003 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 109 transitions. [2022-07-11 22:22:15,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 4.476190476190476) internal successors, (188), 42 states have internal predecessors, (188), 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-11 22:22:15,003 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 109 transitions. [2022-07-11 22:22:15,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-11 22:22:15,004 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:22:15,004 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 22:22:15,021 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-07-11 22:22:15,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-11 22:22:15,207 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:22:15,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:22:15,208 INFO L85 PathProgramCache]: Analyzing trace with hash 277238954, now seen corresponding path program 11 times [2022-07-11 22:22:15,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 22:22:15,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397924467] [2022-07-11 22:22:15,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:22:15,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 22:22:15,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:22:15,847 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 22:22:15,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 22:22:15,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397924467] [2022-07-11 22:22:15,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397924467] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 22:22:15,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2065763817] [2022-07-11 22:22:15,848 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-11 22:22:15,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:22:15,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 22:22:15,849 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 22:22:15,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-11 22:22:16,091 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-07-11 22:22:16,092 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 22:22:16,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 37 conjunts are in the unsatisfiable core [2022-07-11 22:22:16,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 22:22:16,115 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-11 22:22:16,149 INFO L356 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2022-07-11 22:22:16,149 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2022-07-11 22:22:16,204 INFO L356 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2022-07-11 22:22:16,205 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2022-07-11 22:22:16,225 INFO L356 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2022-07-11 22:22:16,226 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2022-07-11 22:22:16,473 INFO L356 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-07-11 22:22:16,474 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 20 [2022-07-11 22:22:16,496 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-11 22:22:16,496 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 22:22:18,652 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_201| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_201|)) (forall ((v_ArrVal_569 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_201|) (- 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_569) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 20)) 0)))) is different from false [2022-07-11 22:22:22,141 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2022-07-11 22:22:22,144 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1704 treesize of output 1672 [2022-07-11 22:22:22,457 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 28 trivial. 3 not checked. [2022-07-11 22:22:22,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2065763817] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 22:22:22,458 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 22:22:22,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 15, 17] total 35 [2022-07-11 22:22:22,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093358105] [2022-07-11 22:22:22,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 22:22:22,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-07-11 22:22:22,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 22:22:22,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-07-11 22:22:22,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=964, Unknown=10, NotChecked=64, Total=1190 [2022-07-11 22:22:22,460 INFO L87 Difference]: Start difference. First operand 103 states and 109 transitions. Second operand has 35 states, 35 states have (on average 4.085714285714285) internal successors, (143), 35 states have internal predecessors, (143), 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-11 22:22:24,907 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|)) (.cse3 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) (- 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset|))) (let ((.cse1 (= (select .cse2 .cse3) 0)) (.cse0 (div c_~CELLCOUNT~0 2))) (and (<= 4 .cse0) (<= 3 |c_ULTIMATE.start_main_~i~0#1|) .cse1 (forall ((|v_ULTIMATE.start_main_~i~0#1_201| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_201|)) (forall ((v_ArrVal_569 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_201|) (- 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_569) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 20)) 0)))) (= (select .cse2 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset|)) 0) (let ((.cse4 (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) .cse0))) (or (and .cse1 (= .cse3 (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 20)) .cse4) (<= (+ 2 |c_ULTIMATE.start_main_~i~0#1|) .cse0) (and (not (= (+ c_~CELLCOUNT~0 (* .cse0 (- 2))) 0)) (not (<= 0 c_~CELLCOUNT~0)) .cse4))) (<= |c_ULTIMATE.start_main_~i~0#1| 3)))) is different from false [2022-07-11 22:22:26,910 WARN L833 $PredicateComparison]: unable to prove that (and (= 0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 20))) (forall ((|v_ULTIMATE.start_main_~i~0#1_201| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_201|)) (forall ((v_ArrVal_569 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_201|) (- 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_569) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 20)) 0))))) is different from false [2022-07-11 22:22:27,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 22:22:27,460 INFO L93 Difference]: Finished difference Result 186 states and 201 transitions. [2022-07-11 22:22:27,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-07-11 22:22:27,460 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 4.085714285714285) internal successors, (143), 35 states have internal predecessors, (143), 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 77 [2022-07-11 22:22:27,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 22:22:27,461 INFO L225 Difference]: With dead ends: 186 [2022-07-11 22:22:27,461 INFO L226 Difference]: Without dead ends: 184 [2022-07-11 22:22:27,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 147 SyntacticMatches, 9 SemanticMatches, 69 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1216 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=582, Invalid=3974, Unknown=12, NotChecked=402, Total=4970 [2022-07-11 22:22:27,463 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 157 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 1056 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 1344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 183 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-11 22:22:27,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 370 Invalid, 1344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1056 Invalid, 0 Unknown, 183 Unchecked, 0.5s Time] [2022-07-11 22:22:27,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-07-11 22:22:27,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 128. [2022-07-11 22:22:27,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 127 states have (on average 1.0708661417322836) internal successors, (136), 127 states have internal predecessors, (136), 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-11 22:22:27,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 136 transitions. [2022-07-11 22:22:27,473 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 136 transitions. Word has length 77 [2022-07-11 22:22:27,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 22:22:27,473 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 136 transitions. [2022-07-11 22:22:27,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 4.085714285714285) internal successors, (143), 35 states have internal predecessors, (143), 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-11 22:22:27,474 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 136 transitions. [2022-07-11 22:22:27,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-11 22:22:27,474 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:22:27,475 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 22:22:27,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-11 22:22:27,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-11 22:22:27,679 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:22:27,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:22:27,680 INFO L85 PathProgramCache]: Analyzing trace with hash 2118097373, now seen corresponding path program 12 times [2022-07-11 22:22:27,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 22:22:27,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219443138] [2022-07-11 22:22:27,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:22:27,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 22:22:27,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:22:29,023 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 12 proven. 158 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 22:22:29,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 22:22:29,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219443138] [2022-07-11 22:22:29,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219443138] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 22:22:29,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [46062485] [2022-07-11 22:22:29,024 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-11 22:22:29,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:22:29,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 22:22:29,027 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 22:22:29,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-11 22:22:29,217 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-07-11 22:22:29,217 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 22:22:29,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-11 22:22:29,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 22:22:29,511 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-11 22:22:29,555 INFO L356 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2022-07-11 22:22:29,555 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2022-07-11 22:22:29,646 INFO L356 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2022-07-11 22:22:29,647 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2022-07-11 22:22:29,708 INFO L356 Elim1Store]: treesize reduction 100, result has 20.0 percent of original size [2022-07-11 22:22:29,708 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 43 [2022-07-11 22:22:31,024 INFO L356 Elim1Store]: treesize reduction 101, result has 12.2 percent of original size [2022-07-11 22:22:31,024 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 73 treesize of output 36 [2022-07-11 22:22:31,095 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 84 proven. 78 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-11 22:22:31,095 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 22:22:46,014 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 81 [2022-07-11 22:22:46,027 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-11 22:22:46,028 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 5739 treesize of output 5667 [2022-07-11 22:22:54,004 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 80 proven. 82 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-11 22:22:54,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [46062485] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 22:22:54,004 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 22:22:54,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 28, 30] total 76 [2022-07-11 22:22:54,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246544102] [2022-07-11 22:22:54,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 22:22:54,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2022-07-11 22:22:54,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 22:22:54,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2022-07-11 22:22:54,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=680, Invalid=4995, Unknown=25, NotChecked=0, Total=5700 [2022-07-11 22:22:54,007 INFO L87 Difference]: Start difference. First operand 128 states and 136 transitions. Second operand has 76 states, 76 states have (on average 3.039473684210526) internal successors, (231), 76 states have internal predecessors, (231), 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-11 22:22:56,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 22:22:56,880 INFO L93 Difference]: Finished difference Result 293 states and 317 transitions. [2022-07-11 22:22:56,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-07-11 22:22:56,881 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 76 states have (on average 3.039473684210526) internal successors, (231), 76 states have internal predecessors, (231), 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 83 [2022-07-11 22:22:56,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 22:22:56,883 INFO L225 Difference]: With dead ends: 293 [2022-07-11 22:22:56,883 INFO L226 Difference]: Without dead ends: 278 [2022-07-11 22:22:56,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 142 SyntacticMatches, 7 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3947 ImplicationChecksByTransitivity, 21.3s TimeCoverageRelationStatistics Valid=1904, Invalid=11877, Unknown=25, NotChecked=0, Total=13806 [2022-07-11 22:22:56,887 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 182 mSDsluCounter, 837 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 1231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 494 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-11 22:22:56,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 869 Invalid, 1231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 615 Invalid, 0 Unknown, 494 Unchecked, 0.3s Time] [2022-07-11 22:22:56,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2022-07-11 22:22:56,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 265. [2022-07-11 22:22:56,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 264 states have (on average 1.0833333333333333) internal successors, (286), 264 states have internal predecessors, (286), 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-11 22:22:56,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 286 transitions. [2022-07-11 22:22:56,918 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 286 transitions. Word has length 83 [2022-07-11 22:22:56,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 22:22:56,918 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 286 transitions. [2022-07-11 22:22:56,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 76 states have (on average 3.039473684210526) internal successors, (231), 76 states have internal predecessors, (231), 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-11 22:22:56,918 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 286 transitions. [2022-07-11 22:22:56,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-11 22:22:56,919 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:22:56,919 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 22:22:56,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-11 22:22:57,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-11 22:22:57,120 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:22:57,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:22:57,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1725070363, now seen corresponding path program 13 times [2022-07-11 22:22:57,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 22:22:57,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720472812] [2022-07-11 22:22:57,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:22:57,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 22:22:57,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:22:58,380 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 12 proven. 158 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 22:22:58,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 22:22:58,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720472812] [2022-07-11 22:22:58,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720472812] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 22:22:58,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [687245975] [2022-07-11 22:22:58,380 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-11 22:22:58,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:22:58,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 22:22:58,382 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 22:22:58,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-11 22:22:58,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:22:58,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 59 conjunts are in the unsatisfiable core [2022-07-11 22:22:58,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 22:22:58,645 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-11 22:22:58,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:22:58,688 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-11 22:22:58,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:22:58,771 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2022-07-11 22:22:58,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:22:58,780 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2022-07-11 22:22:58,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:22:58,835 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2022-07-11 22:22:58,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:22:58,847 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2022-07-11 22:22:58,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:22:58,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2022-07-11 22:22:58,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:22:58,897 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2022-07-11 22:22:58,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:22:58,938 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2022-07-11 22:22:58,944 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2022-07-11 22:22:59,273 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-11 22:22:59,295 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 12 proven. 158 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 22:22:59,295 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 22:23:22,305 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2022-07-11 22:23:22,307 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2022-07-11 22:23:22,470 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 12 proven. 156 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-11 22:23:22,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [687245975] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 22:23:22,470 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 22:23:22,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 16, 22] total 57 [2022-07-11 22:23:22,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707638368] [2022-07-11 22:23:22,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 22:23:22,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-07-11 22:23:22,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 22:23:22,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-07-11 22:23:22,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=2920, Unknown=3, NotChecked=0, Total=3192 [2022-07-11 22:23:22,472 INFO L87 Difference]: Start difference. First operand 265 states and 286 transitions. Second operand has 57 states, 57 states have (on average 4.157894736842105) internal successors, (237), 57 states have internal predecessors, (237), 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-11 22:23:28,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 22:23:28,872 INFO L93 Difference]: Finished difference Result 490 states and 539 transitions. [2022-07-11 22:23:28,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-07-11 22:23:28,873 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 4.157894736842105) internal successors, (237), 57 states have internal predecessors, (237), 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 83 [2022-07-11 22:23:28,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 22:23:28,874 INFO L225 Difference]: With dead ends: 490 [2022-07-11 22:23:28,874 INFO L226 Difference]: Without dead ends: 460 [2022-07-11 22:23:28,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 151 SyntacticMatches, 12 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3000 ImplicationChecksByTransitivity, 29.3s TimeCoverageRelationStatistics Valid=783, Invalid=8526, Unknown=3, NotChecked=0, Total=9312 [2022-07-11 22:23:28,876 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 448 mSDsluCounter, 779 mSDsCounter, 0 mSdLazyCounter, 1361 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 1745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 1361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 169 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-11 22:23:28,876 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 817 Invalid, 1745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 1361 Invalid, 0 Unknown, 169 Unchecked, 0.7s Time] [2022-07-11 22:23:28,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2022-07-11 22:23:28,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 317. [2022-07-11 22:23:28,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 316 states have (on average 1.0917721518987342) internal successors, (345), 316 states have internal predecessors, (345), 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-11 22:23:28,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 345 transitions. [2022-07-11 22:23:28,914 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 345 transitions. Word has length 83 [2022-07-11 22:23:28,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 22:23:28,914 INFO L495 AbstractCegarLoop]: Abstraction has 317 states and 345 transitions. [2022-07-11 22:23:28,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 4.157894736842105) internal successors, (237), 57 states have internal predecessors, (237), 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-11 22:23:28,915 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 345 transitions. [2022-07-11 22:23:28,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-07-11 22:23:28,916 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:23:28,916 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 22:23:28,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-11 22:23:29,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:23:29,127 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:23:29,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:23:29,128 INFO L85 PathProgramCache]: Analyzing trace with hash 2048133086, now seen corresponding path program 14 times [2022-07-11 22:23:29,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 22:23:29,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195469901] [2022-07-11 22:23:29,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:23:29,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 22:23:29,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:23:29,357 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 49 proven. 45 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-07-11 22:23:29,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 22:23:29,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195469901] [2022-07-11 22:23:29,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195469901] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 22:23:29,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [635403366] [2022-07-11 22:23:29,357 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-11 22:23:29,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:23:29,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 22:23:29,359 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 22:23:29,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-11 22:23:29,448 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-11 22:23:29,448 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 22:23:29,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-11 22:23:29,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 22:23:29,598 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 62 proven. 28 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-07-11 22:23:29,598 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 22:23:29,804 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 62 proven. 28 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-07-11 22:23:29,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [635403366] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 22:23:29,804 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 22:23:29,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 21 [2022-07-11 22:23:29,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573678002] [2022-07-11 22:23:29,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 22:23:29,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-11 22:23:29,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 22:23:29,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-11 22:23:29,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2022-07-11 22:23:29,805 INFO L87 Difference]: Start difference. First operand 317 states and 345 transitions. Second operand has 21 states, 21 states have (on average 4.238095238095238) internal successors, (89), 21 states have internal predecessors, (89), 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-11 22:23:30,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 22:23:30,079 INFO L93 Difference]: Finished difference Result 388 states and 423 transitions. [2022-07-11 22:23:30,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-11 22:23:30,080 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.238095238095238) internal successors, (89), 21 states have internal predecessors, (89), 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 85 [2022-07-11 22:23:30,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 22:23:30,081 INFO L225 Difference]: With dead ends: 388 [2022-07-11 22:23:30,081 INFO L226 Difference]: Without dead ends: 278 [2022-07-11 22:23:30,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 158 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=224, Invalid=706, Unknown=0, NotChecked=0, Total=930 [2022-07-11 22:23:30,082 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 202 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 22:23:30,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 90 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 22:23:30,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2022-07-11 22:23:30,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 247. [2022-07-11 22:23:30,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 246 states have (on average 1.08130081300813) internal successors, (266), 246 states have internal predecessors, (266), 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-11 22:23:30,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 266 transitions. [2022-07-11 22:23:30,110 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 266 transitions. Word has length 85 [2022-07-11 22:23:30,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 22:23:30,111 INFO L495 AbstractCegarLoop]: Abstraction has 247 states and 266 transitions. [2022-07-11 22:23:30,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.238095238095238) internal successors, (89), 21 states have internal predecessors, (89), 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-11 22:23:30,111 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 266 transitions. [2022-07-11 22:23:30,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-07-11 22:23:30,112 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:23:30,112 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 22:23:30,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-11 22:23:30,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:23:30,327 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:23:30,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:23:30,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1479714958, now seen corresponding path program 15 times [2022-07-11 22:23:30,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 22:23:30,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110305228] [2022-07-11 22:23:30,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:23:30,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 22:23:30,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:23:30,923 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 22:23:30,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 22:23:30,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110305228] [2022-07-11 22:23:30,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110305228] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 22:23:30,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742032906] [2022-07-11 22:23:30,924 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-11 22:23:30,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:23:30,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 22:23:30,925 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 22:23:30,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-11 22:23:31,323 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-07-11 22:23:31,323 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 22:23:31,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 44 conjunts are in the unsatisfiable core [2022-07-11 22:23:31,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 22:23:31,516 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-11 22:23:31,559 INFO L356 Elim1Store]: treesize reduction 60, result has 16.7 percent of original size [2022-07-11 22:23:31,559 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 28 [2022-07-11 22:23:31,956 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 13 proven. 182 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-11 22:23:31,956 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 22:23:32,216 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2022-07-11 22:23:32,218 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2022-07-11 22:23:32,654 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 195 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-11 22:23:32,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [742032906] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 22:23:32,654 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 22:23:32,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23, 23] total 42 [2022-07-11 22:23:32,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505211059] [2022-07-11 22:23:32,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 22:23:32,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-07-11 22:23:32,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 22:23:32,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-11 22:23:32,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1534, Unknown=0, NotChecked=0, Total=1722 [2022-07-11 22:23:32,656 INFO L87 Difference]: Start difference. First operand 247 states and 266 transitions. Second operand has 42 states, 42 states have (on average 3.761904761904762) internal successors, (158), 42 states have internal predecessors, (158), 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-11 22:23:34,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 22:23:34,679 INFO L93 Difference]: Finished difference Result 383 states and 417 transitions. [2022-07-11 22:23:34,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2022-07-11 22:23:34,680 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 3.761904761904762) internal successors, (158), 42 states have internal predecessors, (158), 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 89 [2022-07-11 22:23:34,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 22:23:34,681 INFO L225 Difference]: With dead ends: 383 [2022-07-11 22:23:34,681 INFO L226 Difference]: Without dead ends: 381 [2022-07-11 22:23:34,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 152 SyntacticMatches, 10 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2851 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=926, Invalid=8386, Unknown=0, NotChecked=0, Total=9312 [2022-07-11 22:23:34,690 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 214 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 1541 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 1670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 1541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 10 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-11 22:23:34,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 669 Invalid, 1670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 1541 Invalid, 0 Unknown, 10 Unchecked, 0.7s Time] [2022-07-11 22:23:34,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2022-07-11 22:23:34,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 265. [2022-07-11 22:23:34,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 264 states have (on average 1.0871212121212122) internal successors, (287), 264 states have internal predecessors, (287), 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-11 22:23:34,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 287 transitions. [2022-07-11 22:23:34,718 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 287 transitions. Word has length 89 [2022-07-11 22:23:34,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 22:23:34,718 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 287 transitions. [2022-07-11 22:23:34,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 3.761904761904762) internal successors, (158), 42 states have internal predecessors, (158), 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-11 22:23:34,718 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 287 transitions. [2022-07-11 22:23:34,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-07-11 22:23:34,719 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:23:34,719 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 22:23:34,736 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-07-11 22:23:34,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:23:34,920 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:23:34,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:23:34,920 INFO L85 PathProgramCache]: Analyzing trace with hash 339321817, now seen corresponding path program 16 times [2022-07-11 22:23:34,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 22:23:34,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950481463] [2022-07-11 22:23:34,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:23:34,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 22:23:34,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:23:35,165 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 49 proven. 62 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-07-11 22:23:35,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 22:23:35,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950481463] [2022-07-11 22:23:35,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950481463] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 22:23:35,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363726521] [2022-07-11 22:23:35,165 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-11 22:23:35,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:23:35,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 22:23:35,167 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 22:23:35,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-11 22:23:35,274 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-11 22:23:35,274 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 22:23:35,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-11 22:23:35,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 22:23:35,496 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 66 proven. 45 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-07-11 22:23:35,496 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 22:23:35,817 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 66 proven. 45 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-07-11 22:23:35,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1363726521] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 22:23:35,818 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 22:23:35,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 23 [2022-07-11 22:23:35,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667224703] [2022-07-11 22:23:35,818 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 22:23:35,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-11 22:23:35,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 22:23:35,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-11 22:23:35,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2022-07-11 22:23:35,820 INFO L87 Difference]: Start difference. First operand 265 states and 287 transitions. Second operand has 23 states, 23 states have (on average 4.130434782608695) internal successors, (95), 23 states have internal predecessors, (95), 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-11 22:23:36,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 22:23:36,595 INFO L93 Difference]: Finished difference Result 428 states and 465 transitions. [2022-07-11 22:23:36,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-07-11 22:23:36,595 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 4.130434782608695) internal successors, (95), 23 states have internal predecessors, (95), 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 89 [2022-07-11 22:23:36,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 22:23:36,596 INFO L225 Difference]: With dead ends: 428 [2022-07-11 22:23:36,597 INFO L226 Difference]: Without dead ends: 373 [2022-07-11 22:23:36,597 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 164 SyntacticMatches, 6 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 801 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=552, Invalid=1898, Unknown=0, NotChecked=0, Total=2450 [2022-07-11 22:23:36,598 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 600 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 600 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-11 22:23:36,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [600 Valid, 263 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-11 22:23:36,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2022-07-11 22:23:36,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 291. [2022-07-11 22:23:36,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 290 states have (on average 1.0862068965517242) internal successors, (315), 290 states have internal predecessors, (315), 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-11 22:23:36,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 315 transitions. [2022-07-11 22:23:36,629 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 315 transitions. Word has length 89 [2022-07-11 22:23:36,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 22:23:36,630 INFO L495 AbstractCegarLoop]: Abstraction has 291 states and 315 transitions. [2022-07-11 22:23:36,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.130434782608695) internal successors, (95), 23 states have internal predecessors, (95), 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-11 22:23:36,630 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 315 transitions. [2022-07-11 22:23:36,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-07-11 22:23:36,631 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:23:36,631 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 22:23:36,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-07-11 22:23:36,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:23:36,838 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:23:36,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:23:36,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1444230572, now seen corresponding path program 17 times [2022-07-11 22:23:36,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 22:23:36,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39839043] [2022-07-11 22:23:36,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:23:36,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 22:23:36,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:23:38,214 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 61 proven. 141 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-11 22:23:38,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 22:23:38,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39839043] [2022-07-11 22:23:38,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39839043] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 22:23:38,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [172757365] [2022-07-11 22:23:38,215 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-11 22:23:38,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:23:38,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 22:23:38,216 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 22:23:38,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-07-11 22:23:38,977 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2022-07-11 22:23:38,978 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 22:23:38,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 46 conjunts are in the unsatisfiable core [2022-07-11 22:23:38,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 22:23:39,081 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-11 22:23:39,110 INFO L356 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2022-07-11 22:23:39,111 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2022-07-11 22:23:39,149 INFO L356 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2022-07-11 22:23:39,150 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 25 [2022-07-11 22:23:39,161 INFO L356 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2022-07-11 22:23:39,161 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 25 [2022-07-11 22:23:39,198 INFO L356 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2022-07-11 22:23:39,199 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 25 [2022-07-11 22:23:39,244 INFO L356 Elim1Store]: treesize reduction 88, result has 20.0 percent of original size [2022-07-11 22:23:39,244 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 40 [2022-07-11 22:23:39,311 INFO L356 Elim1Store]: treesize reduction 88, result has 20.0 percent of original size [2022-07-11 22:23:39,311 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 40 [2022-07-11 22:23:39,334 INFO L356 Elim1Store]: treesize reduction 88, result has 20.0 percent of original size [2022-07-11 22:23:39,335 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 40 [2022-07-11 22:23:39,404 INFO L356 Elim1Store]: treesize reduction 88, result has 20.0 percent of original size [2022-07-11 22:23:39,404 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 40 [2022-07-11 22:23:39,432 INFO L356 Elim1Store]: treesize reduction 121, result has 15.4 percent of original size [2022-07-11 22:23:39,432 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 47 treesize of output 40 [2022-07-11 22:23:39,796 INFO L356 Elim1Store]: treesize reduction 14, result has 6.7 percent of original size [2022-07-11 22:23:39,796 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 10 [2022-07-11 22:23:39,819 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 64 proven. 72 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-07-11 22:23:39,819 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 22:23:42,016 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_365| Int)) (or (forall ((v_ArrVal_1102 Int)) (< (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_365|) (- 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_1102) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 12)) |c_ULTIMATE.start_main_~MINVAL~0#1|)) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_365|)))) is different from false [2022-07-11 22:23:49,882 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_366| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_366|)) (forall ((v_ArrVal_1097 Int) (|v_ULTIMATE.start_main_~i~0#1_365| Int) (v_ArrVal_1100 Int) (v_ArrVal_1102 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_366| 1) |v_ULTIMATE.start_main_~i~0#1_365|)) (< (select (store (let ((.cse0 (* 8 |v_ULTIMATE.start_main_~i~0#1_366|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ .cse0 (- 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_1097) (+ .cse0 |c_ULTIMATE.start_main_~#volArray~0#1.offset| (- 8)) v_ArrVal_1100)) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_365|) (- 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_1102) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 12)) |c_ULTIMATE.start_main_~MINVAL~0#1|))))) is different from false [2022-07-11 22:23:57,895 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_367| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_367|)) (forall ((v_ArrVal_1095 Int) (|v_ULTIMATE.start_main_~i~0#1_366| Int) (v_ArrVal_1097 Int) (|v_ULTIMATE.start_main_~i~0#1_365| Int) (v_ArrVal_1100 Int) (v_ArrVal_1102 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_366| 1) |v_ULTIMATE.start_main_~i~0#1_365|)) (< (select (store (let ((.cse1 (* 8 |v_ULTIMATE.start_main_~i~0#1_366|))) (store (store (let ((.cse0 (* 8 |v_ULTIMATE.start_main_~i~0#1_367|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ .cse0 (- 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) 0) (+ .cse0 |c_ULTIMATE.start_main_~#volArray~0#1.offset| (- 8)) v_ArrVal_1095)) (+ .cse1 (- 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_1097) (+ .cse1 |c_ULTIMATE.start_main_~#volArray~0#1.offset| (- 8)) v_ArrVal_1100)) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_365|) (- 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_1102) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 12)) |c_ULTIMATE.start_main_~MINVAL~0#1|) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_367| 1) |v_ULTIMATE.start_main_~i~0#1_366|)))))) is different from false [2022-07-11 22:24:06,180 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_368| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_367| Int) (v_ArrVal_1095 Int) (|v_ULTIMATE.start_main_~i~0#1_366| Int) (v_ArrVal_1097 Int) (|v_ULTIMATE.start_main_~i~0#1_365| Int) (v_ArrVal_1100 Int) (v_ArrVal_1102 Int) (v_ArrVal_1091 Int) (v_ArrVal_1090 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_368| 1) |v_ULTIMATE.start_main_~i~0#1_367|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_366| 1) |v_ULTIMATE.start_main_~i~0#1_365|)) (< (select (store (let ((.cse2 (* 8 |v_ULTIMATE.start_main_~i~0#1_366|))) (store (store (let ((.cse1 (* 8 |v_ULTIMATE.start_main_~i~0#1_367|))) (store (store (let ((.cse0 (* 8 |v_ULTIMATE.start_main_~i~0#1_368|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ .cse0 (- 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_1090) (+ .cse0 |c_ULTIMATE.start_main_~#volArray~0#1.offset| (- 8)) v_ArrVal_1091)) (+ .cse1 (- 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) 0) (+ .cse1 |c_ULTIMATE.start_main_~#volArray~0#1.offset| (- 8)) v_ArrVal_1095)) (+ .cse2 (- 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_1097) (+ .cse2 |c_ULTIMATE.start_main_~#volArray~0#1.offset| (- 8)) v_ArrVal_1100)) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_365|) (- 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) v_ArrVal_1102) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 12)) |c_ULTIMATE.start_main_~MINVAL~0#1|) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_367| 1) |v_ULTIMATE.start_main_~i~0#1_366|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_368|)))) is different from false [2022-07-11 22:24:13,164 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 79 [2022-07-11 22:24:13,213 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3624927208 treesize of output 3623878632