./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-tiling/nr5.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/nr5.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 7a05e17fa6f76d5004d5085f0b83441da7dbecb194f05c3b661e69c00b5f4df0 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-11 22:22:57,458 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-11 22:22:57,459 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-11 22:22:57,509 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-11 22:22:57,509 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-11 22:22:57,510 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-11 22:22:57,511 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-11 22:22:57,512 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-11 22:22:57,513 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-11 22:22:57,514 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-11 22:22:57,515 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-11 22:22:57,516 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-11 22:22:57,516 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-11 22:22:57,517 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-11 22:22:57,517 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-11 22:22:57,518 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-11 22:22:57,519 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-11 22:22:57,519 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-11 22:22:57,520 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-11 22:22:57,522 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-11 22:22:57,523 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-11 22:22:57,523 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-11 22:22:57,524 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-11 22:22:57,525 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-11 22:22:57,525 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-11 22:22:57,527 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-11 22:22:57,528 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-11 22:22:57,528 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-11 22:22:57,529 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-11 22:22:57,529 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-11 22:22:57,530 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-11 22:22:57,530 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-11 22:22:57,531 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-11 22:22:57,531 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-11 22:22:57,532 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-11 22:22:57,533 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-11 22:22:57,533 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-11 22:22:57,534 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-11 22:22:57,534 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-11 22:22:57,534 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-11 22:22:57,535 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-11 22:22:57,536 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-11 22:22:57,537 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:22:57,553 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-11 22:22:57,557 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-11 22:22:57,558 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-11 22:22:57,559 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-11 22:22:57,559 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-11 22:22:57,559 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-11 22:22:57,560 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-11 22:22:57,560 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-11 22:22:57,560 INFO L138 SettingsManager]: * Use SBE=true [2022-07-11 22:22:57,561 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-11 22:22:57,561 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-11 22:22:57,561 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-11 22:22:57,561 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-11 22:22:57,561 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-11 22:22:57,561 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-11 22:22:57,562 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-11 22:22:57,562 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-11 22:22:57,562 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-11 22:22:57,562 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-11 22:22:57,563 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-11 22:22:57,563 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-11 22:22:57,563 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-11 22:22:57,564 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-11 22:22:57,564 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-11 22:22:57,564 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 22:22:57,564 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-11 22:22:57,564 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-11 22:22:57,564 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-11 22:22:57,565 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-11 22:22:57,565 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-11 22:22:57,565 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-11 22:22:57,565 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-11 22:22:57,565 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-11 22:22:57,565 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 -> 7a05e17fa6f76d5004d5085f0b83441da7dbecb194f05c3b661e69c00b5f4df0 [2022-07-11 22:22:57,743 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-11 22:22:57,757 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-11 22:22:57,758 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-11 22:22:57,759 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-11 22:22:57,759 INFO L275 PluginConnector]: CDTParser initialized [2022-07-11 22:22:57,760 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-tiling/nr5.c [2022-07-11 22:22:57,808 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7278bacae/1dd38af51cff455488ebf31bb8265f57/FLAGa8ec44ddd [2022-07-11 22:22:58,120 INFO L306 CDTParser]: Found 1 translation units. [2022-07-11 22:22:58,120 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/nr5.c [2022-07-11 22:22:58,125 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7278bacae/1dd38af51cff455488ebf31bb8265f57/FLAGa8ec44ddd [2022-07-11 22:22:58,550 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7278bacae/1dd38af51cff455488ebf31bb8265f57 [2022-07-11 22:22:58,552 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-11 22:22:58,553 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-11 22:22:58,556 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-11 22:22:58,556 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-11 22:22:58,558 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-11 22:22:58,559 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 10:22:58" (1/1) ... [2022-07-11 22:22:58,560 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c074cc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:22:58, skipping insertion in model container [2022-07-11 22:22:58,560 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 10:22:58" (1/1) ... [2022-07-11 22:22:58,564 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-11 22:22:58,576 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-11 22:22:58,676 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/nr5.c[394,407] [2022-07-11 22:22:58,700 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 22:22:58,709 INFO L203 MainTranslator]: Completed pre-run [2022-07-11 22:22:58,722 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/nr5.c[394,407] [2022-07-11 22:22:58,737 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 22:22:58,747 INFO L208 MainTranslator]: Completed translation [2022-07-11 22:22:58,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:22:58 WrapperNode [2022-07-11 22:22:58,748 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-11 22:22:58,749 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-11 22:22:58,749 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-11 22:22:58,749 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-11 22:22:58,753 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:22:58" (1/1) ... [2022-07-11 22:22:58,763 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:22:58" (1/1) ... [2022-07-11 22:22:58,780 INFO L137 Inliner]: procedures = 15, calls = 22, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 80 [2022-07-11 22:22:58,780 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-11 22:22:58,781 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-11 22:22:58,781 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-11 22:22:58,781 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-11 22:22:58,786 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:22:58" (1/1) ... [2022-07-11 22:22:58,787 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:22:58" (1/1) ... [2022-07-11 22:22:58,790 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:22:58" (1/1) ... [2022-07-11 22:22:58,790 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:22:58" (1/1) ... [2022-07-11 22:22:58,802 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:22:58" (1/1) ... [2022-07-11 22:22:58,804 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:22:58" (1/1) ... [2022-07-11 22:22:58,805 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:22:58" (1/1) ... [2022-07-11 22:22:58,809 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-11 22:22:58,809 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-11 22:22:58,809 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-11 22:22:58,809 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-11 22:22:58,810 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:22:58" (1/1) ... [2022-07-11 22:22:58,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 22:22:58,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 22:22:58,831 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:22:58,835 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:22:58,857 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-11 22:22:58,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-11 22:22:58,858 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-11 22:22:58,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-11 22:22:58,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-11 22:22:58,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-11 22:22:58,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-11 22:22:58,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-11 22:22:58,903 INFO L234 CfgBuilder]: Building ICFG [2022-07-11 22:22:58,904 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-11 22:22:59,034 INFO L275 CfgBuilder]: Performing block encoding [2022-07-11 22:22:59,038 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-11 22:22:59,038 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-11 22:22:59,039 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 10:22:59 BoogieIcfgContainer [2022-07-11 22:22:59,039 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-11 22:22:59,040 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-11 22:22:59,040 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-11 22:22:59,042 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-11 22:22:59,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 10:22:58" (1/3) ... [2022-07-11 22:22:59,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26a65cc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 10:22:59, skipping insertion in model container [2022-07-11 22:22:59,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:22:58" (2/3) ... [2022-07-11 22:22:59,044 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26a65cc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 10:22:59, skipping insertion in model container [2022-07-11 22:22:59,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 10:22:59" (3/3) ... [2022-07-11 22:22:59,044 INFO L111 eAbstractionObserver]: Analyzing ICFG nr5.c [2022-07-11 22:22:59,053 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-11 22:22:59,054 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-11 22:22:59,097 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-11 22:22:59,110 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@7156b928, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@439cf33a [2022-07-11 22:22:59,110 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-11 22:22:59,122 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 23 states have (on average 1.565217391304348) internal successors, (36), 24 states have internal predecessors, (36), 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:59,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-11 22:22:59,128 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:22:59,128 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 22:22:59,129 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:22:59,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:22:59,136 INFO L85 PathProgramCache]: Analyzing trace with hash -405965127, now seen corresponding path program 1 times [2022-07-11 22:22:59,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 22:22:59,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068686248] [2022-07-11 22:22:59,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:22:59,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 22:22:59,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:22:59,301 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:22:59,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 22:22:59,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068686248] [2022-07-11 22:22:59,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068686248] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 22:22:59,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 22:22:59,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-11 22:22:59,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409879839] [2022-07-11 22:22:59,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 22:22:59,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-11 22:22:59,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 22:22:59,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-11 22:22:59,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-11 22:22:59,345 INFO L87 Difference]: Start difference. First operand has 25 states, 23 states have (on average 1.565217391304348) internal successors, (36), 24 states have internal predecessors, (36), 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 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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:59,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 22:22:59,359 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2022-07-11 22:22:59,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-11 22:22:59,361 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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 13 [2022-07-11 22:22:59,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 22:22:59,366 INFO L225 Difference]: With dead ends: 45 [2022-07-11 22:22:59,366 INFO L226 Difference]: Without dead ends: 20 [2022-07-11 22:22:59,369 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:22:59,373 INFO L413 NwaCegarLoop]: 31 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, 31 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:22:59,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 22:22:59,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-07-11 22:22:59,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-07-11 22:22:59,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 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:59,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2022-07-11 22:22:59,394 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 13 [2022-07-11 22:22:59,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 22:22:59,394 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2022-07-11 22:22:59,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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:59,395 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-07-11 22:22:59,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-11 22:22:59,395 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:22:59,395 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 22:22:59,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-11 22:22:59,396 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:22:59,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:22:59,398 INFO L85 PathProgramCache]: Analyzing trace with hash 274093243, now seen corresponding path program 1 times [2022-07-11 22:22:59,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 22:22:59,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668588443] [2022-07-11 22:22:59,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:22:59,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 22:22:59,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:22:59,474 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:22:59,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 22:22:59,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668588443] [2022-07-11 22:22:59,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668588443] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 22:22:59,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 22:22:59,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 22:22:59,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248238842] [2022-07-11 22:22:59,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 22:22:59,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 22:22:59,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 22:22:59,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 22:22:59,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 22:22:59,477 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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:59,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 22:22:59,501 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2022-07-11 22:22:59,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-11 22:22:59,501 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2022-07-11 22:22:59,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 22:22:59,502 INFO L225 Difference]: With dead ends: 29 [2022-07-11 22:22:59,502 INFO L226 Difference]: Without dead ends: 27 [2022-07-11 22:22:59,502 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:22:59,503 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 9 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 62 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:22:59,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 62 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 22:22:59,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-11 22:22:59,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2022-07-11 22:22:59,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 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:59,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-07-11 22:22:59,507 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 13 [2022-07-11 22:22:59,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 22:22:59,507 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-07-11 22:22:59,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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:59,508 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-07-11 22:22:59,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-11 22:22:59,508 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:22:59,508 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 22:22:59,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-11 22:22:59,509 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:22:59,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:22:59,509 INFO L85 PathProgramCache]: Analyzing trace with hash 274152825, now seen corresponding path program 1 times [2022-07-11 22:22:59,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 22:22:59,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000443947] [2022-07-11 22:22:59,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:22:59,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 22:22:59,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:22:59,692 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:22:59,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 22:22:59,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000443947] [2022-07-11 22:22:59,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000443947] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 22:22:59,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 22:22:59,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-11 22:22:59,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565107271] [2022-07-11 22:22:59,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 22:22:59,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-11 22:22:59,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 22:22:59,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-11 22:22:59,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-11 22:22:59,694 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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:59,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 22:22:59,722 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2022-07-11 22:22:59,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-11 22:22:59,723 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 13 [2022-07-11 22:22:59,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 22:22:59,724 INFO L225 Difference]: With dead ends: 38 [2022-07-11 22:22:59,724 INFO L226 Difference]: Without dead ends: 27 [2022-07-11 22:22:59,724 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:22:59,725 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 58 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 22:22:59,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 27 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 22:22:59,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-11 22:22:59,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2022-07-11 22:22:59,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 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:59,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-07-11 22:22:59,729 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 13 [2022-07-11 22:22:59,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 22:22:59,729 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-07-11 22:22:59,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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:59,730 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-07-11 22:22:59,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-11 22:22:59,730 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:22:59,730 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 22:22:59,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-11 22:22:59,731 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:22:59,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:22:59,731 INFO L85 PathProgramCache]: Analyzing trace with hash -715167033, now seen corresponding path program 1 times [2022-07-11 22:22:59,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 22:22:59,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855928807] [2022-07-11 22:22:59,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:22:59,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 22:22:59,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:22:59,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 22:22:59,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 22:22:59,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855928807] [2022-07-11 22:22:59,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855928807] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 22:22:59,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 22:22:59,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 22:22:59,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100232566] [2022-07-11 22:22:59,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 22:22:59,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 22:22:59,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 22:22:59,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 22:22:59,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 22:22:59,756 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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:59,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 22:22:59,769 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2022-07-11 22:22:59,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 22:22:59,770 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 16 [2022-07-11 22:22:59,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 22:22:59,770 INFO L225 Difference]: With dead ends: 42 [2022-07-11 22:22:59,770 INFO L226 Difference]: Without dead ends: 26 [2022-07-11 22:22:59,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:22:59,771 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 3 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 22:22:59,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 36 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 22:22:59,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-07-11 22:22:59,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2022-07-11 22:22:59,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 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:59,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-07-11 22:22:59,775 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 16 [2022-07-11 22:22:59,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 22:22:59,776 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-07-11 22:22:59,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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:59,776 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-07-11 22:22:59,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-11 22:22:59,776 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:22:59,776 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 22:22:59,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-11 22:22:59,777 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:22:59,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:22:59,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1618667584, now seen corresponding path program 1 times [2022-07-11 22:22:59,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 22:22:59,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075582868] [2022-07-11 22:22:59,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:22:59,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 22:22:59,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:22:59,817 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 22:22:59,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 22:22:59,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075582868] [2022-07-11 22:22:59,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075582868] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 22:22:59,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200841344] [2022-07-11 22:22:59,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:22:59,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:22:59,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 22:22:59,822 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:22:59,822 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:22:59,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:22:59,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-11 22:22:59,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 22:22:59,899 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 22:22:59,899 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 22:22:59,917 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 22:22:59,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [200841344] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 22:22:59,918 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 22:22:59,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-07-11 22:22:59,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154287018] [2022-07-11 22:22:59,918 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 22:22:59,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-11 22:22:59,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 22:22:59,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-11 22:22:59,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-07-11 22:22:59,919 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 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:59,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 22:22:59,962 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-07-11 22:22:59,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-11 22:22:59,962 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 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 19 [2022-07-11 22:22:59,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 22:22:59,963 INFO L225 Difference]: With dead ends: 50 [2022-07-11 22:22:59,963 INFO L226 Difference]: Without dead ends: 33 [2022-07-11 22:22:59,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-07-11 22:22:59,964 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 18 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 22:22:59,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 68 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 22:22:59,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-07-11 22:22:59,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-07-11 22:22:59,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.25) internal successors, (40), 32 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:22:59,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2022-07-11 22:22:59,969 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 19 [2022-07-11 22:22:59,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 22:22:59,970 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2022-07-11 22:22:59,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 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:59,970 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2022-07-11 22:22:59,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-11 22:22:59,970 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:22:59,971 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 22:22:59,990 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:23:00,188 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:23:00,188 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:23:00,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:23:00,189 INFO L85 PathProgramCache]: Analyzing trace with hash -2124634745, now seen corresponding path program 2 times [2022-07-11 22:23:00,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 22:23:00,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742098179] [2022-07-11 22:23:00,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:23:00,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 22:23:00,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:23:00,255 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 22:23:00,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 22:23:00,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742098179] [2022-07-11 22:23:00,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742098179] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 22:23:00,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1070964504] [2022-07-11 22:23:00,257 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-11 22:23:00,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:23:00,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 22:23:00,260 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:23:00,261 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:23:00,309 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-11 22:23:00,309 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 22:23:00,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-11 22:23:00,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 22:23:00,347 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 22:23:00,347 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 22:23:00,365 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 22:23:00,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1070964504] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 22:23:00,365 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 22:23:00,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2022-07-11 22:23:00,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252266839] [2022-07-11 22:23:00,366 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 22:23:00,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-11 22:23:00,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 22:23:00,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-11 22:23:00,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-07-11 22:23:00,367 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 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:23:00,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 22:23:00,413 INFO L93 Difference]: Finished difference Result 62 states and 78 transitions. [2022-07-11 22:23:00,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-11 22:23:00,414 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 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) Word has length 28 [2022-07-11 22:23:00,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 22:23:00,414 INFO L225 Difference]: With dead ends: 62 [2022-07-11 22:23:00,417 INFO L226 Difference]: Without dead ends: 36 [2022-07-11 22:23:00,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-07-11 22:23:00,418 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 19 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 22:23:00,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 52 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 22:23:00,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-07-11 22:23:00,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-07-11 22:23:00,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 35 states have internal predecessors, (44), 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:00,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2022-07-11 22:23:00,428 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 28 [2022-07-11 22:23:00,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 22:23:00,430 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2022-07-11 22:23:00,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 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:23:00,430 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2022-07-11 22:23:00,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-11 22:23:00,431 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:23:00,431 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 22:23:00,452 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:23:00,649 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:23:00,650 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:23:00,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:23:00,650 INFO L85 PathProgramCache]: Analyzing trace with hash -233654912, now seen corresponding path program 3 times [2022-07-11 22:23:00,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 22:23:00,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025563933] [2022-07-11 22:23:00,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:23:00,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 22:23:00,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:23:00,744 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 25 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 22:23:00,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 22:23:00,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025563933] [2022-07-11 22:23:00,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025563933] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 22:23:00,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928299521] [2022-07-11 22:23:00,745 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-11 22:23:00,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:23:00,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 22:23:00,747 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:23:00,747 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:23:00,796 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-11 22:23:00,796 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 22:23:00,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-11 22:23:00,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 22:23:00,847 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-11 22:23:00,848 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 22:23:00,883 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-11 22:23:00,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928299521] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 22:23:00,883 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 22:23:00,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 11 [2022-07-11 22:23:00,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389848719] [2022-07-11 22:23:00,884 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 22:23:00,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-11 22:23:00,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 22:23:00,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-11 22:23:00,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-11 22:23:00,887 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 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:00,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 22:23:00,970 INFO L93 Difference]: Finished difference Result 70 states and 87 transitions. [2022-07-11 22:23:00,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-11 22:23:00,970 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 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 31 [2022-07-11 22:23:00,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 22:23:00,972 INFO L225 Difference]: With dead ends: 70 [2022-07-11 22:23:00,972 INFO L226 Difference]: Without dead ends: 41 [2022-07-11 22:23:00,973 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2022-07-11 22:23:00,976 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 42 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 22:23:00,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 59 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 22:23:00,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-07-11 22:23:00,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2022-07-11 22:23:00,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 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:00,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2022-07-11 22:23:00,988 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 31 [2022-07-11 22:23:00,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 22:23:00,989 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2022-07-11 22:23:00,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 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:00,989 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2022-07-11 22:23:00,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-11 22:23:00,989 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:23:00,990 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 22:23:01,007 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:23:01,190 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:23:01,190 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:23:01,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:23:01,191 INFO L85 PathProgramCache]: Analyzing trace with hash 467409666, now seen corresponding path program 1 times [2022-07-11 22:23:01,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 22:23:01,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92566060] [2022-07-11 22:23:01,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:23:01,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 22:23:01,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:23:01,638 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 22:23:01,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 22:23:01,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92566060] [2022-07-11 22:23:01,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92566060] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 22:23:01,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1114586585] [2022-07-11 22:23:01,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:23:01,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:23:01,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 22:23:01,640 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:23:01,641 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:23:01,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:23:01,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-11 22:23:01,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 22:23:01,763 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 18 treesize of output 14 [2022-07-11 22:23:01,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:23:01,841 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 31 treesize of output 30 [2022-07-11 22:23:01,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:23:01,885 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 31 treesize of output 30 [2022-07-11 22:23:01,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:23:01,933 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 31 treesize of output 30 [2022-07-11 22:23:01,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:23:01,986 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 24 treesize of output 23 [2022-07-11 22:23:02,051 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:23:02,069 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 22:23:02,069 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 22:23:41,042 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~j~0#1_36| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_36| 1) |c_ULTIMATE.start_main_~j~0#1|)) (forall ((v_ArrVal_92 Int) (|v_ULTIMATE.start_main_~j~0#1_35| Int) (v_ArrVal_94 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_35| 1) |v_ULTIMATE.start_main_~j~0#1_36|)) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| (select (let ((.cse0 (* 20 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |v_ULTIMATE.start_main_~j~0#1_36| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse0) v_ArrVal_92) (+ (* |v_ULTIMATE.start_main_~j~0#1_35| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse0) v_ArrVal_94)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|)))))) is different from false [2022-07-11 22:23:55,197 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~j~0#1_37| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_37| 1) |c_ULTIMATE.start_main_~j~0#1|)) (forall ((v_ArrVal_92 Int) (|v_ULTIMATE.start_main_~j~0#1_35| Int) (|v_ULTIMATE.start_main_~j~0#1_36| Int) (v_ArrVal_89 Int) (v_ArrVal_94 Int)) (or (<= |c_ULTIMATE.start_main_~MINVAL~0#1| (select (let ((.cse0 (* 20 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_37| (- 4)) .cse0) v_ArrVal_89) (+ (* |v_ULTIMATE.start_main_~j~0#1_36| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse0) v_ArrVal_92) (+ (* |v_ULTIMATE.start_main_~j~0#1_35| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse0) v_ArrVal_94)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|)) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_35| 1) |v_ULTIMATE.start_main_~j~0#1_36|)) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_36| 1) |v_ULTIMATE.start_main_~j~0#1_37|)))))) is different from false [2022-07-11 22:24:11,897 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~j~0#1_38| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_38| 1) |c_ULTIMATE.start_main_~j~0#1|)) (forall ((v_ArrVal_92 Int) (|v_ULTIMATE.start_main_~j~0#1_35| Int) (|v_ULTIMATE.start_main_~j~0#1_36| Int) (|v_ULTIMATE.start_main_~j~0#1_37| Int) (v_ArrVal_88 Int) (v_ArrVal_89 Int) (v_ArrVal_94 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_37| 1) |v_ULTIMATE.start_main_~j~0#1_38|)) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_35| 1) |v_ULTIMATE.start_main_~j~0#1_36|)) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| (select (let ((.cse0 (* 20 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |v_ULTIMATE.start_main_~j~0#1_38| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse0) v_ArrVal_88) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_37| (- 4)) .cse0) v_ArrVal_89) (+ (* |v_ULTIMATE.start_main_~j~0#1_36| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse0) v_ArrVal_92) (+ (* |v_ULTIMATE.start_main_~j~0#1_35| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse0) v_ArrVal_94)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|)) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_36| 1) |v_ULTIMATE.start_main_~j~0#1_37|)))))) is different from false [2022-07-11 22:24:11,922 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 57 treesize of output 55 [2022-07-11 22:24:11,937 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 3440 treesize of output 3432 [2022-07-11 22:24:16,812 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 21 refuted. 4 times theorem prover too weak. 0 trivial. 9 not checked. [2022-07-11 22:24:16,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1114586585] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 22:24:16,812 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 22:24:16,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 16] total 40 [2022-07-11 22:24:16,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766044383] [2022-07-11 22:24:16,813 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 22:24:16,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-07-11 22:24:16,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 22:24:16,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-11 22:24:16,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=1068, Unknown=39, NotChecked=216, Total=1560 [2022-07-11 22:24:16,815 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 40 states, 40 states have (on average 2.1) internal successors, (84), 40 states have internal predecessors, (84), 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:24:18,850 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |c_ULTIMATE.start_main_~j~0#1| (- 4)) (* 20 |c_ULTIMATE.start_main_~i~0#1|)))) (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) .cse2))) (and (<= |c_ULTIMATE.start_main_~j~0#1| .cse0) (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| 0) (= (+ (- 2) |c_ULTIMATE.start_main_~MINVAL~0#1|) 0) (= 2 |c_ULTIMATE.start_main_~MINVAL~0#1|) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| 2) (forall ((|v_ULTIMATE.start_main_~j~0#1_38| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_38| 1) |c_ULTIMATE.start_main_~j~0#1|)) (forall ((v_ArrVal_92 Int) (|v_ULTIMATE.start_main_~j~0#1_35| Int) (|v_ULTIMATE.start_main_~j~0#1_36| Int) (|v_ULTIMATE.start_main_~j~0#1_37| Int) (v_ArrVal_88 Int) (v_ArrVal_89 Int) (v_ArrVal_94 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_37| 1) |v_ULTIMATE.start_main_~j~0#1_38|)) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_35| 1) |v_ULTIMATE.start_main_~j~0#1_36|)) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| (select (let ((.cse1 (* 20 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |v_ULTIMATE.start_main_~j~0#1_38| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse1) v_ArrVal_88) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_37| (- 4)) .cse1) v_ArrVal_89) (+ (* |v_ULTIMATE.start_main_~j~0#1_36| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse1) v_ArrVal_92) (+ (* |v_ULTIMATE.start_main_~j~0#1_35| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse1) v_ArrVal_94)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|)) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_36| 1) |v_ULTIMATE.start_main_~j~0#1_37|)))))) (= .cse2 0) (= .cse0 5) (= |c_ULTIMATE.start_main_~j~0#1| 5) (= |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2022-07-11 22:24:20,900 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|)) (.cse2 (* 20 |c_ULTIMATE.start_main_~i~0#1|))) (and (= 5 (select .cse0 0)) (forall ((|v_ULTIMATE.start_main_~j~0#1_37| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_37| 1) |c_ULTIMATE.start_main_~j~0#1|)) (forall ((v_ArrVal_92 Int) (|v_ULTIMATE.start_main_~j~0#1_35| Int) (|v_ULTIMATE.start_main_~j~0#1_36| Int) (v_ArrVal_89 Int) (v_ArrVal_94 Int)) (or (<= |c_ULTIMATE.start_main_~MINVAL~0#1| (select (let ((.cse1 (* 20 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_37| (- 4)) .cse1) v_ArrVal_89) (+ (* |v_ULTIMATE.start_main_~j~0#1_36| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse1) v_ArrVal_92) (+ (* |v_ULTIMATE.start_main_~j~0#1_35| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse1) v_ArrVal_94)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|)) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_35| 1) |v_ULTIMATE.start_main_~j~0#1_36|)) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_36| 1) |v_ULTIMATE.start_main_~j~0#1_37|)))))) (<= |c_ULTIMATE.start_main_~j~0#1| 4) (<= 5 (select .cse0 (+ (- 20) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse2))) (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| 0) (= (+ (- 2) |c_ULTIMATE.start_main_~MINVAL~0#1|) 0) (= 2 |c_ULTIMATE.start_main_~MINVAL~0#1|) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| 2) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 1) (div (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse2) 4)) (forall ((|v_ULTIMATE.start_main_~j~0#1_36| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_36| 1) |c_ULTIMATE.start_main_~j~0#1|)) (forall ((v_ArrVal_92 Int) (|v_ULTIMATE.start_main_~j~0#1_35| Int) (v_ArrVal_94 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_35| 1) |v_ULTIMATE.start_main_~j~0#1_36|)) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| (select (let ((.cse3 (* 20 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |v_ULTIMATE.start_main_~j~0#1_36| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse3) v_ArrVal_92) (+ (* |v_ULTIMATE.start_main_~j~0#1_35| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse3) v_ArrVal_94)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|)))))) (= (+ (- 1) |c_ULTIMATE.start_main_~i~0#1|) 0) (= |c_ULTIMATE.start_main_~i~0#1| 1))) is different from false [2022-07-11 22:24:22,958 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|)) (.cse1 (* 20 |c_ULTIMATE.start_main_~i~0#1|))) (and (= 5 (select .cse0 0)) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 2) (div (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse1) 4)) (forall ((|v_ULTIMATE.start_main_~j~0#1_37| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_37| 1) |c_ULTIMATE.start_main_~j~0#1|)) (forall ((v_ArrVal_92 Int) (|v_ULTIMATE.start_main_~j~0#1_35| Int) (|v_ULTIMATE.start_main_~j~0#1_36| Int) (v_ArrVal_89 Int) (v_ArrVal_94 Int)) (or (<= |c_ULTIMATE.start_main_~MINVAL~0#1| (select (let ((.cse2 (* 20 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_37| (- 4)) .cse2) v_ArrVal_89) (+ (* |v_ULTIMATE.start_main_~j~0#1_36| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse2) v_ArrVal_92) (+ (* |v_ULTIMATE.start_main_~j~0#1_35| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse2) v_ArrVal_94)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|)) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_35| 1) |v_ULTIMATE.start_main_~j~0#1_36|)) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_36| 1) |v_ULTIMATE.start_main_~j~0#1_37|)))))) (<= 5 (select .cse0 (+ (- 20) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse1))) (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| 0) (= (+ (- 2) |c_ULTIMATE.start_main_~MINVAL~0#1|) 0) (<= |c_ULTIMATE.start_main_~j~0#1| 3) (= 2 |c_ULTIMATE.start_main_~MINVAL~0#1|) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| 2) (forall ((|v_ULTIMATE.start_main_~j~0#1_36| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_36| 1) |c_ULTIMATE.start_main_~j~0#1|)) (forall ((v_ArrVal_92 Int) (|v_ULTIMATE.start_main_~j~0#1_35| Int) (v_ArrVal_94 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_35| 1) |v_ULTIMATE.start_main_~j~0#1_36|)) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| (select (let ((.cse3 (* 20 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |v_ULTIMATE.start_main_~j~0#1_36| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse3) v_ArrVal_92) (+ (* |v_ULTIMATE.start_main_~j~0#1_35| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse3) v_ArrVal_94)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|)))))) (= (+ (- 1) |c_ULTIMATE.start_main_~i~0#1|) 0) (= |c_ULTIMATE.start_main_~i~0#1| 1))) is different from false [2022-07-11 22:24:25,060 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|)) (.cse1 (* 20 |c_ULTIMATE.start_main_~i~0#1|))) (and (= 5 (select .cse0 0)) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 2) (div (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse1) 4)) (forall ((|v_ULTIMATE.start_main_~j~0#1_37| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_37| 1) |c_ULTIMATE.start_main_~j~0#1|)) (forall ((v_ArrVal_92 Int) (|v_ULTIMATE.start_main_~j~0#1_35| Int) (|v_ULTIMATE.start_main_~j~0#1_36| Int) (v_ArrVal_89 Int) (v_ArrVal_94 Int)) (or (<= |c_ULTIMATE.start_main_~MINVAL~0#1| (select (let ((.cse2 (* 20 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_37| (- 4)) .cse2) v_ArrVal_89) (+ (* |v_ULTIMATE.start_main_~j~0#1_36| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse2) v_ArrVal_92) (+ (* |v_ULTIMATE.start_main_~j~0#1_35| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse2) v_ArrVal_94)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|)) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_35| 1) |v_ULTIMATE.start_main_~j~0#1_36|)) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_36| 1) |v_ULTIMATE.start_main_~j~0#1_37|)))))) (<= 5 (select .cse0 (+ (- 20) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse1))) (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| 0) (= (+ (- 2) |c_ULTIMATE.start_main_~MINVAL~0#1|) 0) (<= |c_ULTIMATE.start_main_~j~0#1| 2) (= 2 |c_ULTIMATE.start_main_~MINVAL~0#1|) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| 2) (forall ((|v_ULTIMATE.start_main_~j~0#1_36| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_36| 1) |c_ULTIMATE.start_main_~j~0#1|)) (forall ((v_ArrVal_92 Int) (|v_ULTIMATE.start_main_~j~0#1_35| Int) (v_ArrVal_94 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_35| 1) |v_ULTIMATE.start_main_~j~0#1_36|)) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| (select (let ((.cse3 (* 20 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |v_ULTIMATE.start_main_~j~0#1_36| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse3) v_ArrVal_92) (+ (* |v_ULTIMATE.start_main_~j~0#1_35| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse3) v_ArrVal_94)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|)))))) (= (+ (- 1) |c_ULTIMATE.start_main_~i~0#1|) 0) (= |c_ULTIMATE.start_main_~i~0#1| 1))) is different from false [2022-07-11 22:24:27,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 22:24:27,549 INFO L93 Difference]: Finished difference Result 119 states and 135 transitions. [2022-07-11 22:24:27,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-11 22:24:27,550 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.1) internal successors, (84), 40 states have internal predecessors, (84), 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 31 [2022-07-11 22:24:27,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 22:24:27,552 INFO L225 Difference]: With dead ends: 119 [2022-07-11 22:24:27,552 INFO L226 Difference]: Without dead ends: 109 [2022-07-11 22:24:27,553 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 41 SyntacticMatches, 6 SemanticMatches, 60 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 892 ImplicationChecksByTransitivity, 84.5s TimeCoverageRelationStatistics Valid=585, Invalid=2369, Unknown=44, NotChecked=784, Total=3782 [2022-07-11 22:24:27,553 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 145 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 312 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 22:24:27,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 183 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 417 Invalid, 0 Unknown, 312 Unchecked, 0.2s Time] [2022-07-11 22:24:27,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-07-11 22:24:27,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 63. [2022-07-11 22:24:27,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.1612903225806452) internal successors, (72), 62 states have internal predecessors, (72), 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:24:27,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2022-07-11 22:24:27,567 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 31 [2022-07-11 22:24:27,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 22:24:27,567 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2022-07-11 22:24:27,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.1) internal successors, (84), 40 states have internal predecessors, (84), 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:24:27,567 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2022-07-11 22:24:27,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-11 22:24:27,568 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:24:27,568 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 22:24:27,584 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:24:27,768 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:24:27,768 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:24:27,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:24:27,769 INFO L85 PathProgramCache]: Analyzing trace with hash 594002453, now seen corresponding path program 1 times [2022-07-11 22:24:27,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 22:24:27,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621026338] [2022-07-11 22:24:27,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:24:27,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 22:24:27,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:24:28,252 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 22:24:28,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 22:24:28,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621026338] [2022-07-11 22:24:28,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621026338] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 22:24:28,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317796280] [2022-07-11 22:24:28,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:24:28,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:24:28,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 22:24:28,260 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:24:28,261 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:24:28,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:24:28,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-11 22:24:28,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 22:24:28,392 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 18 treesize of output 14 [2022-07-11 22:24:28,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:24:28,453 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 31 treesize of output 30 [2022-07-11 22:24:28,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:24:28,499 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 31 treesize of output 30 [2022-07-11 22:24:28,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:24:28,544 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:24:28,676 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:24:28,685 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 9 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 22:24:28,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 22:25:00,956 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~j~0#1_47| Int)) (or (forall ((v_ArrVal_126 Int) (v_ArrVal_123 Int) (|v_ULTIMATE.start_main_~j~0#1_46| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_46| 1) |v_ULTIMATE.start_main_~j~0#1_47|)) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| (select (let ((.cse0 (* 20 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_47| (- 4)) .cse0) v_ArrVal_123) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_46| (- 4)) .cse0) v_ArrVal_126)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4))))) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_47| 1) |c_ULTIMATE.start_main_~j~0#1|)))) is different from false [2022-07-11 22:25:19,708 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~j~0#1_48| Int)) (or (forall ((v_ArrVal_126 Int) (v_ArrVal_123 Int) (|v_ULTIMATE.start_main_~j~0#1_46| Int) (v_ArrVal_121 Int) (|v_ULTIMATE.start_main_~j~0#1_47| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_46| 1) |v_ULTIMATE.start_main_~j~0#1_47|)) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_47| 1) |v_ULTIMATE.start_main_~j~0#1_48|)) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| (select (let ((.cse0 (* 20 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_48| (- 4)) .cse0) v_ArrVal_121) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_47| (- 4)) .cse0) v_ArrVal_123) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_46| (- 4)) .cse0) v_ArrVal_126)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4))))) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_48| 1) |c_ULTIMATE.start_main_~j~0#1|)))) is different from false [2022-07-11 22:25:19,720 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 49 treesize of output 47 [2022-07-11 22:25:19,724 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 1972 treesize of output 1956 [2022-07-11 22:25:24,174 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 2 proven. 29 refuted. 2 times theorem prover too weak. 0 trivial. 7 not checked. [2022-07-11 22:25:24,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1317796280] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 22:25:24,174 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 22:25:24,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 16] total 41 [2022-07-11 22:25:24,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545521012] [2022-07-11 22:25:24,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 22:25:24,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-07-11 22:25:24,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 22:25:24,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-07-11 22:25:24,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=1220, Unknown=24, NotChecked=150, Total=1640 [2022-07-11 22:25:24,175 INFO L87 Difference]: Start difference. First operand 63 states and 72 transitions. Second operand has 41 states, 41 states have (on average 2.4878048780487805) internal successors, (102), 41 states have internal predecessors, (102), 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:25:26,232 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (* 20 |c_ULTIMATE.start_main_~i~0#1|))) (and (forall ((|v_ULTIMATE.start_main_~j~0#1_48| Int)) (or (forall ((v_ArrVal_126 Int) (v_ArrVal_123 Int) (|v_ULTIMATE.start_main_~j~0#1_46| Int) (v_ArrVal_121 Int) (|v_ULTIMATE.start_main_~j~0#1_47| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_46| 1) |v_ULTIMATE.start_main_~j~0#1_47|)) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_47| 1) |v_ULTIMATE.start_main_~j~0#1_48|)) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| (select (let ((.cse0 (* 20 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_48| (- 4)) .cse0) v_ArrVal_121) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_47| (- 4)) .cse0) v_ArrVal_123) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_46| (- 4)) .cse0) v_ArrVal_126)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4))))) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_48| 1) |c_ULTIMATE.start_main_~j~0#1|)))) (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| 0) (<= 4 |c_ULTIMATE.start_main_~j~0#1|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |c_ULTIMATE.start_main_~j~0#1| (- 4)) .cse1)) |c_ULTIMATE.start_main_~j~0#1|) (= 2 |c_ULTIMATE.start_main_~MINVAL~0#1|) (< (+ 3 (* |c_ULTIMATE.start_main_~j~0#1| 4)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse1)) (= (+ (- 1) |c_ULTIMATE.start_main_~i~0#1|) 0))) is different from false [2022-07-11 22:25:28,253 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~j~0#1_47| Int)) (or (forall ((v_ArrVal_126 Int) (v_ArrVal_123 Int) (|v_ULTIMATE.start_main_~j~0#1_46| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_46| 1) |v_ULTIMATE.start_main_~j~0#1_47|)) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| (select (let ((.cse0 (* 20 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_47| (- 4)) .cse0) v_ArrVal_123) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_46| (- 4)) .cse0) v_ArrVal_126)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4))))) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_47| 1) |c_ULTIMATE.start_main_~j~0#1|)))) (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| 0) (= (+ (- 2) |c_ULTIMATE.start_main_~MINVAL~0#1|) 0) (<= |c_ULTIMATE.start_main_~j~0#1| 3) (<= 4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) 4)) (= (+ (- 1) |c_ULTIMATE.start_main_~i~0#1|) 0)) is different from false [2022-07-11 22:25:30,355 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|))) (and (<= 4 (select .cse0 (+ (- 16) |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* 20 |c_ULTIMATE.start_main_~i~0#1|)))) (forall ((|v_ULTIMATE.start_main_~j~0#1_47| Int)) (or (forall ((v_ArrVal_126 Int) (v_ArrVal_123 Int) (|v_ULTIMATE.start_main_~j~0#1_46| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_46| 1) |v_ULTIMATE.start_main_~j~0#1_47|)) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| (select (let ((.cse1 (* 20 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_47| (- 4)) .cse1) v_ArrVal_123) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_46| (- 4)) .cse1) v_ArrVal_126)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4))))) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_47| 1) |c_ULTIMATE.start_main_~j~0#1|)))) (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| 0) (= (+ (- 2) |c_ULTIMATE.start_main_~MINVAL~0#1|) 0) (<= |c_ULTIMATE.start_main_~j~0#1| 2) (<= |c_ULTIMATE.start_main_~j~0#1| 3) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| 2) (<= 4 (select .cse0 4)) (= (+ (- 1) |c_ULTIMATE.start_main_~i~0#1|) 0) (= |c_ULTIMATE.start_main_~i~0#1| 1))) is different from false [2022-07-11 22:25:35,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 22:25:35,075 INFO L93 Difference]: Finished difference Result 129 states and 146 transitions. [2022-07-11 22:25:35,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-11 22:25:35,076 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.4878048780487805) internal successors, (102), 41 states have internal predecessors, (102), 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 37 [2022-07-11 22:25:35,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 22:25:35,076 INFO L225 Difference]: With dead ends: 129 [2022-07-11 22:25:35,076 INFO L226 Difference]: Without dead ends: 119 [2022-07-11 22:25:35,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 52 SyntacticMatches, 4 SemanticMatches, 63 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1132 ImplicationChecksByTransitivity, 66.0s TimeCoverageRelationStatistics Valid=589, Invalid=2942, Unknown=29, NotChecked=600, Total=4160 [2022-07-11 22:25:35,078 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 333 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 260 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-11 22:25:35,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 210 Invalid, 859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 468 Invalid, 0 Unknown, 260 Unchecked, 0.3s Time] [2022-07-11 22:25:35,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-07-11 22:25:35,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 79. [2022-07-11 22:25:35,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 1.1666666666666667) internal successors, (91), 78 states have internal predecessors, (91), 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:25:35,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 91 transitions. [2022-07-11 22:25:35,085 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 91 transitions. Word has length 37 [2022-07-11 22:25:35,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 22:25:35,085 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 91 transitions. [2022-07-11 22:25:35,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.4878048780487805) internal successors, (102), 41 states have internal predecessors, (102), 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:25:35,086 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 91 transitions. [2022-07-11 22:25:35,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-11 22:25:35,086 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:25:35,086 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 22:25:35,102 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-07-11 22:25:35,302 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:25:35,303 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:25:35,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:25:35,303 INFO L85 PathProgramCache]: Analyzing trace with hash 879791848, now seen corresponding path program 2 times [2022-07-11 22:25:35,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 22:25:35,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979792246] [2022-07-11 22:25:35,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:25:35,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 22:25:35,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:25:35,602 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 22:25:35,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 22:25:35,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979792246] [2022-07-11 22:25:35,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979792246] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 22:25:35,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255588633] [2022-07-11 22:25:35,603 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-11 22:25:35,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:25:35,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 22:25:35,604 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:25:35,605 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:25:35,658 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-11 22:25:35,658 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 22:25:35,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-11 22:25:35,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 22:25:35,754 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 18 treesize of output 14 [2022-07-11 22:25:35,812 INFO L356 Elim1Store]: treesize reduction 46, result has 20.7 percent of original size [2022-07-11 22:25:35,814 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 31 treesize of output 30 [2022-07-11 22:25:35,856 INFO L356 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2022-07-11 22:25:35,856 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:25:35,983 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:25:35,989 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 22:25:35,989 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 22:26:02,210 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_156 Int) (|v_ULTIMATE.start_main_~j~0#1_57| Int) (v_ArrVal_153 Int)) (or (<= |c_ULTIMATE.start_main_~MINVAL~0#1| (select (let ((.cse0 (* 20 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |c_ULTIMATE.start_main_~j~0#1| (- 4)) .cse0) v_ArrVal_153) (+ (* |v_ULTIMATE.start_main_~j~0#1_57| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse0) v_ArrVal_156)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 8))) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_57| 1) |c_ULTIMATE.start_main_~j~0#1|)))) is different from false [2022-07-11 22:26:04,226 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~j~0#1_58| Int)) (or (forall ((v_ArrVal_156 Int) (|v_ULTIMATE.start_main_~j~0#1_57| Int) (v_ArrVal_153 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_57| 1) |v_ULTIMATE.start_main_~j~0#1_58|)) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| (select (let ((.cse0 (* 20 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |v_ULTIMATE.start_main_~j~0#1_58| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse0) v_ArrVal_153) (+ (* |v_ULTIMATE.start_main_~j~0#1_57| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse0) v_ArrVal_156)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 8))))) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_58| 1) |c_ULTIMATE.start_main_~j~0#1|)))) is different from false [2022-07-11 22:26:04,234 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 39 treesize of output 37 [2022-07-11 22:26:04,236 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 224 treesize of output 220 [2022-07-11 22:26:06,414 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 4 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2022-07-11 22:26:06,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [255588633] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 22:26:06,414 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 22:26:06,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15, 16] total 45 [2022-07-11 22:26:06,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050296270] [2022-07-11 22:26:06,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 22:26:06,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-07-11 22:26:06,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 22:26:06,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-07-11 22:26:06,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=1543, Unknown=15, NotChecked=166, Total=1980 [2022-07-11 22:26:06,416 INFO L87 Difference]: Start difference. First operand 79 states and 91 transitions. Second operand has 45 states, 45 states have (on average 2.6666666666666665) internal successors, (120), 45 states have internal predecessors, (120), 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:26:08,584 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|))) (let ((.cse2 (= (+ (- 2) |c_ULTIMATE.start_main_~MINVAL~0#1|) 0)) (.cse1 (select .cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~#volArray~0#1.offset|)))) (and (<= 3 (select .cse0 (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |c_ULTIMATE.start_main_~j~0#1| (- 4)) (* 20 |c_ULTIMATE.start_main_~i~0#1|)))) (<= 3 |c_ULTIMATE.start_main_~j~0#1|) (or (and (<= 3 .cse1) .cse2) (= .cse1 0)) .cse2 (<= |c_ULTIMATE.start_main_~j~0#1| 3) (forall ((|v_ULTIMATE.start_main_~j~0#1_58| Int)) (or (forall ((v_ArrVal_156 Int) (|v_ULTIMATE.start_main_~j~0#1_57| Int) (v_ArrVal_153 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_57| 1) |v_ULTIMATE.start_main_~j~0#1_58|)) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| (select (let ((.cse3 (* 20 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |v_ULTIMATE.start_main_~j~0#1_58| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse3) v_ArrVal_153) (+ (* |v_ULTIMATE.start_main_~j~0#1_57| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse3) v_ArrVal_156)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 8))))) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_58| 1) |c_ULTIMATE.start_main_~j~0#1|)))) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| .cse1) (= (+ (- 1) |c_ULTIMATE.start_main_~i~0#1|) 0)))) is different from false [2022-07-11 22:26:13,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 22:26:13,576 INFO L93 Difference]: Finished difference Result 231 states and 264 transitions. [2022-07-11 22:26:13,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-07-11 22:26:13,577 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.6666666666666665) internal successors, (120), 45 states have internal predecessors, (120), 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:26:13,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 22:26:13,577 INFO L225 Difference]: With dead ends: 231 [2022-07-11 22:26:13,578 INFO L226 Difference]: Without dead ends: 170 [2022-07-11 22:26:13,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 1768 ImplicationChecksByTransitivity, 37.4s TimeCoverageRelationStatistics Valid=712, Invalid=4685, Unknown=17, NotChecked=438, Total=5852 [2022-07-11 22:26:13,579 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 243 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 161 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-11 22:26:13,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 359 Invalid, 983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 721 Invalid, 0 Unknown, 161 Unchecked, 0.4s Time] [2022-07-11 22:26:13,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-07-11 22:26:13,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 104. [2022-07-11 22:26:13,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.1553398058252426) internal successors, (119), 103 states have internal predecessors, (119), 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:26:13,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 119 transitions. [2022-07-11 22:26:13,589 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 119 transitions. Word has length 43 [2022-07-11 22:26:13,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 22:26:13,589 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 119 transitions. [2022-07-11 22:26:13,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.6666666666666665) internal successors, (120), 45 states have internal predecessors, (120), 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:26:13,590 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 119 transitions. [2022-07-11 22:26:13,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-11 22:26:13,590 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:26:13,590 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 22:26:13,608 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:26:13,808 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:26:13,808 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:26:13,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:26:13,809 INFO L85 PathProgramCache]: Analyzing trace with hash 941831462, now seen corresponding path program 3 times [2022-07-11 22:26:13,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 22:26:13,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676107333] [2022-07-11 22:26:13,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:26:13,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 22:26:13,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:26:13,872 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 19 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-11 22:26:13,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 22:26:13,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676107333] [2022-07-11 22:26:13,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676107333] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 22:26:13,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647877568] [2022-07-11 22:26:13,873 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-11 22:26:13,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:26:13,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 22:26:13,874 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:26:13,875 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:26:13,919 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-07-11 22:26:13,920 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 22:26:13,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-11 22:26:13,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 22:26:13,943 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-11 22:26:13,944 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 22:26:13,972 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-11 22:26:13,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1647877568] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 22:26:13,972 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 22:26:13,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 10 [2022-07-11 22:26:13,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427418935] [2022-07-11 22:26:13,973 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 22:26:13,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-11 22:26:13,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 22:26:13,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-11 22:26:13,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-11 22:26:13,974 INFO L87 Difference]: Start difference. First operand 104 states and 119 transitions. Second operand has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 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:26:14,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 22:26:14,022 INFO L93 Difference]: Finished difference Result 151 states and 174 transitions. [2022-07-11 22:26:14,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-11 22:26:14,023 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 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:26:14,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 22:26:14,024 INFO L225 Difference]: With dead ends: 151 [2022-07-11 22:26:14,024 INFO L226 Difference]: Without dead ends: 79 [2022-07-11 22:26:14,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-07-11 22:26:14,027 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 49 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 22:26:14,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 55 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 22:26:14,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-07-11 22:26:14,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2022-07-11 22:26:14,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 1.0897435897435896) internal successors, (85), 78 states have internal predecessors, (85), 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:26:14,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2022-07-11 22:26:14,049 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 43 [2022-07-11 22:26:14,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 22:26:14,050 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2022-07-11 22:26:14,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 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:26:14,050 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2022-07-11 22:26:14,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-11 22:26:14,051 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:26:14,051 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 22:26:14,069 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:26:14,259 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:26:14,259 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:26:14,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:26:14,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1886597499, now seen corresponding path program 4 times [2022-07-11 22:26:14,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 22:26:14,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380594233] [2022-07-11 22:26:14,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:26:14,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 22:26:14,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:26:14,584 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 15 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 22:26:14,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 22:26:14,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380594233] [2022-07-11 22:26:14,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380594233] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 22:26:14,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [884125376] [2022-07-11 22:26:14,584 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-11 22:26:14,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:26:14,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 22:26:14,586 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:26:14,586 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:26:14,633 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-11 22:26:14,633 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 22:26:14,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-11 22:26:14,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 22:26:14,756 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 18 treesize of output 14 [2022-07-11 22:26:14,812 INFO L356 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2022-07-11 22:26:14,812 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:26:14,981 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:26:14,999 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 6 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 22:26:14,999 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 22:26:31,161 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 29 treesize of output 27 [2022-07-11 22:26:31,163 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 100 treesize of output 96 [2022-07-11 22:26:31,294 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 6 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 22:26:31,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [884125376] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 22:26:31,294 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 22:26:31,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 41 [2022-07-11 22:26:31,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089061625] [2022-07-11 22:26:31,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 22:26:31,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-07-11 22:26:31,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 22:26:31,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-07-11 22:26:31,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=1418, Unknown=8, NotChecked=0, Total=1640 [2022-07-11 22:26:31,296 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand has 41 states, 41 states have (on average 3.2195121951219514) internal successors, (132), 41 states have internal predecessors, (132), 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:26:32,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 22:26:32,130 INFO L93 Difference]: Finished difference Result 197 states and 211 transitions. [2022-07-11 22:26:32,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-07-11 22:26:32,131 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 3.2195121951219514) internal successors, (132), 41 states have internal predecessors, (132), 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:26:32,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 22:26:32,132 INFO L225 Difference]: With dead ends: 197 [2022-07-11 22:26:32,132 INFO L226 Difference]: Without dead ends: 187 [2022-07-11 22:26:32,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 73 SyntacticMatches, 3 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1243 ImplicationChecksByTransitivity, 16.9s TimeCoverageRelationStatistics Valid=498, Invalid=3154, Unknown=8, NotChecked=0, Total=3660 [2022-07-11 22:26:32,134 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 227 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 800 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 1242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 363 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-11 22:26:32,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 442 Invalid, 1242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 800 Invalid, 0 Unknown, 363 Unchecked, 0.4s Time] [2022-07-11 22:26:32,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-07-11 22:26:32,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 140. [2022-07-11 22:26:32,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 139 states have (on average 1.1007194244604317) internal successors, (153), 139 states have internal predecessors, (153), 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:26:32,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 153 transitions. [2022-07-11 22:26:32,144 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 153 transitions. Word has length 49 [2022-07-11 22:26:32,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 22:26:32,145 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 153 transitions. [2022-07-11 22:26:32,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 3.2195121951219514) internal successors, (132), 41 states have internal predecessors, (132), 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:26:32,145 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 153 transitions. [2022-07-11 22:26:32,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-11 22:26:32,146 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:26:32,146 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 8, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 22:26:32,164 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:26:32,356 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:26:32,356 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:26:32,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:26:32,356 INFO L85 PathProgramCache]: Analyzing trace with hash -185464757, now seen corresponding path program 2 times [2022-07-11 22:26:32,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 22:26:32,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132340182] [2022-07-11 22:26:32,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:26:32,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 22:26:32,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:26:32,899 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 7 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 22:26:32,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 22:26:32,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132340182] [2022-07-11 22:26:32,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132340182] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 22:26:32,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2036504363] [2022-07-11 22:26:32,899 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-11 22:26:32,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:26:32,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 22:26:32,900 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:26:32,901 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:26:32,948 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-11 22:26:32,948 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 22:26:32,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 51 conjunts are in the unsatisfiable core [2022-07-11 22:26:32,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 22:26:33,017 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 18 treesize of output 14 [2022-07-11 22:26:33,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:26:33,072 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 31 treesize of output 30 [2022-07-11 22:26:33,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:26:33,118 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 31 treesize of output 30 [2022-07-11 22:26:33,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:26:33,162 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 31 treesize of output 30 [2022-07-11 22:26:33,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:26:33,202 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 31 treesize of output 30 [2022-07-11 22:26:33,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:26:33,293 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:26:33,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:26:33,350 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:26:33,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:26:33,398 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:26:33,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:26:33,442 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:26:33,464 INFO L356 Elim1Store]: treesize reduction 23, result has 39.5 percent of original size [2022-07-11 22:26:33,464 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 33 [2022-07-11 22:26:33,663 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 22 proven. 138 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 22:26:33,664 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 22:27:36,574 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~j~0#1_92| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_92| 1) |c_ULTIMATE.start_main_~j~0#1|)) (forall ((v_ArrVal_267 Int) (|v_ULTIMATE.start_main_~j~0#1_91| Int) (v_ArrVal_270 Int)) (let ((.cse0 (select (let ((.cse1 (* 20 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |v_ULTIMATE.start_main_~j~0#1_92| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse1) v_ArrVal_267) (+ (* |v_ULTIMATE.start_main_~j~0#1_91| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse1) v_ArrVal_270)) |c_ULTIMATE.start_main_~#volArray~0#1.offset|))) (or (= .cse0 0) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| .cse0) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_91| 1) |v_ULTIMATE.start_main_~j~0#1_92|))))))) is different from false