./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/s4if.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-fpi/s4if.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 5fe0a71bff946f0cc68d0dab1416e0ef991c6bf06ad7cbb70643ca18073a3c7e --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 10:42:14,067 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 10:42:14,068 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 10:42:14,107 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 10:42:14,107 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 10:42:14,108 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 10:42:14,110 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 10:42:14,111 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 10:42:14,113 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 10:42:14,115 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 10:42:14,116 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 10:42:14,118 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 10:42:14,119 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 10:42:14,124 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 10:42:14,126 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 10:42:14,128 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 10:42:14,130 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 10:42:14,131 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 10:42:14,133 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 10:42:14,140 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 10:42:14,141 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 10:42:14,143 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 10:42:14,144 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 10:42:14,145 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 10:42:14,146 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 10:42:14,148 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 10:42:14,151 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 10:42:14,151 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 10:42:14,152 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 10:42:14,152 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 10:42:14,153 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 10:42:14,153 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 10:42:14,154 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 10:42:14,154 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 10:42:14,155 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 10:42:14,156 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 10:42:14,156 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 10:42:14,157 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 10:42:14,157 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 10:42:14,157 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 10:42:14,158 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 10:42:14,159 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 10:42:14,159 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 10:42:14,181 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 10:42:14,181 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 10:42:14,182 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 10:42:14,182 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 10:42:14,182 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 10:42:14,183 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 10:42:14,183 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 10:42:14,183 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 10:42:14,184 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 10:42:14,184 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 10:42:14,185 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 10:42:14,185 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 10:42:14,185 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 10:42:14,185 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 10:42:14,185 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 10:42:14,186 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 10:42:14,186 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 10:42:14,186 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 10:42:14,186 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 10:42:14,187 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 10:42:14,188 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 10:42:14,188 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 10:42:14,188 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 10:42:14,188 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 10:42:14,188 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 10:42:14,189 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 10:42:14,189 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 10:42:14,189 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 10:42:14,189 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 10:42:14,189 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 10:42:14,190 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 10:42:14,190 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 10:42:14,190 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 10:42:14,190 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 -> 5fe0a71bff946f0cc68d0dab1416e0ef991c6bf06ad7cbb70643ca18073a3c7e [2022-07-19 10:42:14,420 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 10:42:14,435 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 10:42:14,437 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 10:42:14,438 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 10:42:14,439 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 10:42:14,440 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/s4if.c [2022-07-19 10:42:14,512 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/566256815/ee64ba2f8819406294290271062764aa/FLAG26d18033e [2022-07-19 10:42:14,874 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 10:42:14,874 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s4if.c [2022-07-19 10:42:14,879 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/566256815/ee64ba2f8819406294290271062764aa/FLAG26d18033e [2022-07-19 10:42:15,303 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/566256815/ee64ba2f8819406294290271062764aa [2022-07-19 10:42:15,307 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 10:42:15,309 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 10:42:15,310 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 10:42:15,310 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 10:42:15,313 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 10:42:15,313 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:42:15" (1/1) ... [2022-07-19 10:42:15,314 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3883985c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:42:15, skipping insertion in model container [2022-07-19 10:42:15,314 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:42:15" (1/1) ... [2022-07-19 10:42:15,319 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 10:42:15,336 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 10:42:15,465 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-fpi/s4if.c[587,600] [2022-07-19 10:42:15,481 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 10:42:15,487 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 10:42:15,496 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-fpi/s4if.c[587,600] [2022-07-19 10:42:15,503 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 10:42:15,514 INFO L208 MainTranslator]: Completed translation [2022-07-19 10:42:15,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:42:15 WrapperNode [2022-07-19 10:42:15,515 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 10:42:15,516 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 10:42:15,516 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 10:42:15,516 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 10:42:15,524 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:42:15" (1/1) ... [2022-07-19 10:42:15,529 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:42:15" (1/1) ... [2022-07-19 10:42:15,546 INFO L137 Inliner]: procedures = 17, calls = 30, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 79 [2022-07-19 10:42:15,547 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 10:42:15,547 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 10:42:15,548 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 10:42:15,548 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 10:42:15,554 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:42:15" (1/1) ... [2022-07-19 10:42:15,555 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:42:15" (1/1) ... [2022-07-19 10:42:15,557 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:42:15" (1/1) ... [2022-07-19 10:42:15,557 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:42:15" (1/1) ... [2022-07-19 10:42:15,562 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:42:15" (1/1) ... [2022-07-19 10:42:15,566 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:42:15" (1/1) ... [2022-07-19 10:42:15,567 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:42:15" (1/1) ... [2022-07-19 10:42:15,569 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 10:42:15,569 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 10:42:15,570 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 10:42:15,570 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 10:42:15,571 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:42:15" (1/1) ... [2022-07-19 10:42:15,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 10:42:15,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:42:15,613 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-19 10:42:15,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-19 10:42:15,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 10:42:15,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 10:42:15,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 10:42:15,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 10:42:15,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 10:42:15,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 10:42:15,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 10:42:15,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 10:42:15,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 10:42:15,716 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 10:42:15,717 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 10:42:15,829 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 10:42:15,834 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 10:42:15,834 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-19 10:42:15,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:42:15 BoogieIcfgContainer [2022-07-19 10:42:15,836 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 10:42:15,837 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 10:42:15,838 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 10:42:15,841 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 10:42:15,841 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 10:42:15" (1/3) ... [2022-07-19 10:42:15,842 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@db93305 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:42:15, skipping insertion in model container [2022-07-19 10:42:15,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:42:15" (2/3) ... [2022-07-19 10:42:15,842 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@db93305 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:42:15, skipping insertion in model container [2022-07-19 10:42:15,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:42:15" (3/3) ... [2022-07-19 10:42:15,844 INFO L111 eAbstractionObserver]: Analyzing ICFG s4if.c [2022-07-19 10:42:15,856 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 10:42:15,856 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 10:42:15,921 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 10:42:15,934 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@46983668, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@643127ea [2022-07-19 10:42:15,935 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 10:42:15,938 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 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-19 10:42:15,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-19 10:42:15,949 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:42:15,950 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:42:15,950 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:42:15,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:42:15,962 INFO L85 PathProgramCache]: Analyzing trace with hash 356661439, now seen corresponding path program 1 times [2022-07-19 10:42:15,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:42:15,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605984840] [2022-07-19 10:42:15,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:42:15,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:42:16,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:42:16,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:42:16,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:42:16,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605984840] [2022-07-19 10:42:16,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605984840] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:42:16,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:42:16,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-19 10:42:16,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225685290] [2022-07-19 10:42:16,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:42:16,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-19 10:42:16,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:42:16,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-19 10:42:16,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 10:42:16,144 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 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) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:42:16,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:42:16,163 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2022-07-19 10:42:16,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-19 10:42:16,165 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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 11 [2022-07-19 10:42:16,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:42:16,170 INFO L225 Difference]: With dead ends: 34 [2022-07-19 10:42:16,170 INFO L226 Difference]: Without dead ends: 15 [2022-07-19 10:42:16,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 10:42:16,176 INFO L413 NwaCegarLoop]: 22 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, 22 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:42:16,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:42:16,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-07-19 10:42:16,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-07-19 10:42:16,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:42:16,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2022-07-19 10:42:16,202 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 11 [2022-07-19 10:42:16,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:42:16,203 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2022-07-19 10:42:16,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:42:16,204 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-07-19 10:42:16,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-19 10:42:16,204 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:42:16,204 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:42:16,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 10:42:16,205 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:42:16,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:42:16,208 INFO L85 PathProgramCache]: Analyzing trace with hash -452685187, now seen corresponding path program 1 times [2022-07-19 10:42:16,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:42:16,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418631724] [2022-07-19 10:42:16,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:42:16,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:42:16,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:42:16,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:42:16,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:42:16,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418631724] [2022-07-19 10:42:16,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418631724] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:42:16,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:42:16,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 10:42:16,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061270104] [2022-07-19 10:42:16,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:42:16,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 10:42:16,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:42:16,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 10:42:16,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:42:16,334 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:42:16,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:42:16,375 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2022-07-19 10:42:16,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 10:42:16,376 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 11 [2022-07-19 10:42:16,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:42:16,377 INFO L225 Difference]: With dead ends: 28 [2022-07-19 10:42:16,377 INFO L226 Difference]: Without dead ends: 20 [2022-07-19 10:42:16,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:42:16,379 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 21 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:42:16,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 10 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:42:16,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-07-19 10:42:16,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2022-07-19 10:42:16,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:42:16,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-07-19 10:42:16,388 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2022-07-19 10:42:16,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:42:16,389 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-07-19 10:42:16,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:42:16,390 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-07-19 10:42:16,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-19 10:42:16,391 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:42:16,391 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:42:16,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 10:42:16,392 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:42:16,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:42:16,394 INFO L85 PathProgramCache]: Analyzing trace with hash 623611495, now seen corresponding path program 1 times [2022-07-19 10:42:16,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:42:16,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293557426] [2022-07-19 10:42:16,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:42:16,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:42:16,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:42:16,754 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:42:16,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:42:16,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293557426] [2022-07-19 10:42:16,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293557426] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:42:16,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467803960] [2022-07-19 10:42:16,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:42:16,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:42:16,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:42:16,763 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:42:16,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-19 10:42:16,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:42:16,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-19 10:42:16,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:42:16,921 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 11 treesize of output 7 [2022-07-19 10:42:16,947 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 10 treesize of output 8 [2022-07-19 10:42:16,993 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 14 treesize of output 16 [2022-07-19 10:42:17,080 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-07-19 10:42:17,176 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2022-07-19 10:42:17,204 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:42:17,204 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:42:17,615 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 10:42:17,616 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-07-19 10:42:17,619 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:42:17,622 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 26 treesize of output 18 [2022-07-19 10:42:17,644 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-19 10:42:17,644 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 1 [2022-07-19 10:42:17,648 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 22 treesize of output 10 [2022-07-19 10:42:17,658 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:42:17,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1467803960] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:42:17,658 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:42:17,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 19 [2022-07-19 10:42:17,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51667503] [2022-07-19 10:42:17,659 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:42:17,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-19 10:42:17,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:42:17,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-19 10:42:17,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2022-07-19 10:42:17,661 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:42:17,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:42:17,788 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-07-19 10:42:17,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-19 10:42:17,789 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 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-19 10:42:17,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:42:17,790 INFO L225 Difference]: With dead ends: 36 [2022-07-19 10:42:17,790 INFO L226 Difference]: Without dead ends: 32 [2022-07-19 10:42:17,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 20 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=116, Invalid=346, Unknown=0, NotChecked=0, Total=462 [2022-07-19 10:42:17,792 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 37 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 41 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:42:17,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 49 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 79 Invalid, 0 Unknown, 41 Unchecked, 0.1s Time] [2022-07-19 10:42:17,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-07-19 10:42:17,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 25. [2022-07-19 10:42:17,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:42:17,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2022-07-19 10:42:17,798 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 16 [2022-07-19 10:42:17,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:42:17,799 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2022-07-19 10:42:17,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:42:17,799 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2022-07-19 10:42:17,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-19 10:42:17,800 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:42:17,800 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:42:17,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-19 10:42:18,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:42:18,012 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:42:18,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:42:18,012 INFO L85 PathProgramCache]: Analyzing trace with hash 680869797, now seen corresponding path program 1 times [2022-07-19 10:42:18,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:42:18,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757762860] [2022-07-19 10:42:18,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:42:18,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:42:18,046 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 10:42:18,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [65450243] [2022-07-19 10:42:18,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:42:18,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:42:18,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:42:18,049 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:42:18,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-19 10:42:18,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:42:18,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-19 10:42:18,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:42:18,126 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 11 treesize of output 7 [2022-07-19 10:42:18,182 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-19 10:42:18,191 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-19 10:42:18,192 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:42:18,222 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 14 treesize of output 12 [2022-07-19 10:42:18,225 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 22 treesize of output 20 [2022-07-19 10:42:18,243 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-19 10:42:18,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:42:18,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757762860] [2022-07-19 10:42:18,244 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 10:42:18,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65450243] [2022-07-19 10:42:18,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [65450243] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:42:18,245 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 10:42:18,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-07-19 10:42:18,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564806130] [2022-07-19 10:42:18,245 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 10:42:18,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 10:42:18,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:42:18,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 10:42:18,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-07-19 10:42:18,247 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:42:18,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:42:18,318 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2022-07-19 10:42:18,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 10:42:18,318 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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-19 10:42:18,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:42:18,320 INFO L225 Difference]: With dead ends: 38 [2022-07-19 10:42:18,320 INFO L226 Difference]: Without dead ends: 26 [2022-07-19 10:42:18,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-07-19 10:42:18,325 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 6 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:42:18,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 43 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:42:18,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-07-19 10:42:18,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-07-19 10:42:18,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 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-19 10:42:18,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-07-19 10:42:18,336 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 16 [2022-07-19 10:42:18,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:42:18,337 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-07-19 10:42:18,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:42:18,337 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-07-19 10:42:18,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-19 10:42:18,339 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:42:18,339 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:42:18,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-19 10:42:18,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-07-19 10:42:18,552 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:42:18,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:42:18,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1137819675, now seen corresponding path program 2 times [2022-07-19 10:42:18,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:42:18,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744032453] [2022-07-19 10:42:18,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:42:18,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:42:18,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:42:18,650 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:42:18,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:42:18,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744032453] [2022-07-19 10:42:18,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744032453] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:42:18,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1558085331] [2022-07-19 10:42:18,651 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 10:42:18,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:42:18,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:42:18,653 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:42:18,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-19 10:42:18,703 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 10:42:18,703 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:42:18,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-19 10:42:18,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:42:18,755 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:42:18,756 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:42:18,785 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:42:18,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1558085331] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:42:18,786 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:42:18,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-19 10:42:18,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252092136] [2022-07-19 10:42:18,786 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:42:18,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 10:42:18,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:42:18,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 10:42:18,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-19 10:42:18,788 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:42:18,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:42:18,898 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-07-19 10:42:18,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 10:42:18,898 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 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 18 [2022-07-19 10:42:18,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:42:18,899 INFO L225 Difference]: With dead ends: 33 [2022-07-19 10:42:18,899 INFO L226 Difference]: Without dead ends: 29 [2022-07-19 10:42:18,900 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-07-19 10:42:18,900 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 28 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:42:18,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 25 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:42:18,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-07-19 10:42:18,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 20. [2022-07-19 10:42:18,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:42:18,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2022-07-19 10:42:18,905 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 18 [2022-07-19 10:42:18,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:42:18,905 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2022-07-19 10:42:18,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:42:18,906 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-07-19 10:42:18,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-19 10:42:18,906 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:42:18,906 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:42:18,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-19 10:42:19,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:42:19,116 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:42:19,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:42:19,116 INFO L85 PathProgramCache]: Analyzing trace with hash -479454913, now seen corresponding path program 3 times [2022-07-19 10:42:19,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:42:19,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051958499] [2022-07-19 10:42:19,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:42:19,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:42:19,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:42:19,173 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:42:19,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:42:19,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051958499] [2022-07-19 10:42:19,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051958499] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:42:19,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1739104661] [2022-07-19 10:42:19,175 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-19 10:42:19,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:42:19,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:42:19,176 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:42:19,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-19 10:42:19,249 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-19 10:42:19,250 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:42:19,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-19 10:42:19,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:42:19,288 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:42:19,289 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:42:19,311 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:42:19,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1739104661] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:42:19,312 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:42:19,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-19 10:42:19,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537804611] [2022-07-19 10:42:19,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:42:19,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 10:42:19,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:42:19,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 10:42:19,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-19 10:42:19,314 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:42:19,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:42:19,380 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2022-07-19 10:42:19,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 10:42:19,381 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-19 10:42:19,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:42:19,381 INFO L225 Difference]: With dead ends: 37 [2022-07-19 10:42:19,382 INFO L226 Difference]: Without dead ends: 25 [2022-07-19 10:42:19,382 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-07-19 10:42:19,383 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 23 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:42:19,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 26 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:42:19,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-07-19 10:42:19,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2022-07-19 10:42:19,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 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-19 10:42:19,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2022-07-19 10:42:19,387 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 19 [2022-07-19 10:42:19,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:42:19,387 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2022-07-19 10:42:19,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:42:19,388 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-07-19 10:42:19,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-19 10:42:19,388 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:42:19,388 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:42:19,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-19 10:42:19,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:42:19,607 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:42:19,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:42:19,608 INFO L85 PathProgramCache]: Analyzing trace with hash 634982145, now seen corresponding path program 4 times [2022-07-19 10:42:19,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:42:19,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640262226] [2022-07-19 10:42:19,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:42:19,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:42:19,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:42:19,925 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:42:19,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:42:19,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640262226] [2022-07-19 10:42:19,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640262226] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:42:19,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723946279] [2022-07-19 10:42:19,927 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-19 10:42:19,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:42:19,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:42:19,928 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-19 10:42:19,929 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-19 10:42:19,971 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-19 10:42:19,971 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:42:19,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 36 conjunts are in the unsatisfiable core [2022-07-19 10:42:19,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:42:19,989 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 11 treesize of output 7 [2022-07-19 10:42:20,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:42:20,016 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 14 treesize of output 16 [2022-07-19 10:42:20,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:42:20,052 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 14 treesize of output 16 [2022-07-19 10:42:20,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:42:20,188 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-07-19 10:42:20,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:42:20,294 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-19 10:42:20,294 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 43 [2022-07-19 10:42:20,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:42:20,387 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-19 10:42:20,387 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 34 [2022-07-19 10:42:20,413 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:42:20,414 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:42:24,640 WARN L833 $PredicateComparison]: unable to prove that (forall ((~N~0 Int)) (or (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_47| Int) (|v_ULTIMATE.start_main_~i~0#1_44| Int) (v_ArrVal_152 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_152))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse1 (select v_ArrVal_152 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_47| 4))))) (let ((.cse0 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_44| 4))))) (or (not (= 4 .cse0)) (not (= .cse1 4)) (let ((.cse3 (* ~N~0 4)) (.cse2 (+ .cse4 .cse1 .cse0))) (and (<= .cse2 .cse3) (<= .cse3 .cse2))))))))) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0)))) is different from false [2022-07-19 10:42:24,957 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_47| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_44| Int) (v_ArrVal_152 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_152))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse1 (select v_ArrVal_152 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_47| 4))))) (let ((.cse0 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_44| 4))))) (or (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (= 4 .cse0)) (not (= .cse1 4)) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0)) (let ((.cse3 (* ~N~0 4)) (.cse2 (+ .cse4 .cse1 .cse0))) (and (<= .cse2 .cse3) (<= .cse3 .cse2))))))))) is different from false [2022-07-19 10:42:25,270 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-07-19 10:42:25,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [723946279] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:42:25,271 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:42:25,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 32 [2022-07-19 10:42:25,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860142073] [2022-07-19 10:42:25,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:42:25,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-19 10:42:25,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:42:25,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-19 10:42:25,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=762, Unknown=3, NotChecked=114, Total=992 [2022-07-19 10:42:25,273 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 32 states, 32 states have (on average 1.5625) internal successors, (50), 32 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:42:25,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:42:25,480 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2022-07-19 10:42:25,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-19 10:42:25,481 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.5625) internal successors, (50), 32 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-19 10:42:25,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:42:25,481 INFO L225 Difference]: With dead ends: 36 [2022-07-19 10:42:25,481 INFO L226 Difference]: Without dead ends: 32 [2022-07-19 10:42:25,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 23 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=164, Invalid=963, Unknown=3, NotChecked=130, Total=1260 [2022-07-19 10:42:25,483 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 12 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 152 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:42:25,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 71 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 92 Invalid, 0 Unknown, 152 Unchecked, 0.1s Time] [2022-07-19 10:42:25,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-07-19 10:42:25,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2022-07-19 10:42:25,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:42:25,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-07-19 10:42:25,487 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 21 [2022-07-19 10:42:25,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:42:25,487 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-07-19 10:42:25,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.5625) internal successors, (50), 32 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:42:25,488 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-07-19 10:42:25,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-19 10:42:25,488 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:42:25,488 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:42:25,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-19 10:42:25,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:42:25,709 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:42:25,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:42:25,710 INFO L85 PathProgramCache]: Analyzing trace with hash 692240447, now seen corresponding path program 1 times [2022-07-19 10:42:25,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:42:25,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040231094] [2022-07-19 10:42:25,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:42:25,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:42:25,723 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 10:42:25,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1190685818] [2022-07-19 10:42:25,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:42:25,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:42:25,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:42:25,740 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-19 10:42:25,741 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-19 10:42:25,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:42:25,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-19 10:42:25,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:42:25,821 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 13 treesize of output 9 [2022-07-19 10:42:25,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:42:25,880 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 16 treesize of output 18 [2022-07-19 10:42:25,908 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-19 10:42:25,917 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:42:25,918 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:42:25,946 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_189 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_189) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 4)) is different from false [2022-07-19 10:42:25,953 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_189 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_189) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 4)) is different from false [2022-07-19 10:42:25,962 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 10:42:25,962 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-07-19 10:42:25,968 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 10:42:25,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 38 [2022-07-19 10:42:25,971 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 11 treesize of output 7 [2022-07-19 10:42:26,007 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-07-19 10:42:26,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:42:26,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040231094] [2022-07-19 10:42:26,008 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 10:42:26,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190685818] [2022-07-19 10:42:26,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1190685818] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:42:26,008 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 10:42:26,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2022-07-19 10:42:26,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084427846] [2022-07-19 10:42:26,008 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 10:42:26,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-19 10:42:26,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:42:26,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-19 10:42:26,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=126, Unknown=2, NotChecked=46, Total=210 [2022-07-19 10:42:26,009 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 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-19 10:42:26,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:42:26,160 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2022-07-19 10:42:26,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 10:42:26,160 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 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 21 [2022-07-19 10:42:26,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:42:26,161 INFO L225 Difference]: With dead ends: 41 [2022-07-19 10:42:26,161 INFO L226 Difference]: Without dead ends: 34 [2022-07-19 10:42:26,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=215, Unknown=2, NotChecked=62, Total=342 [2022-07-19 10:42:26,162 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 17 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 45 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:42:26,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 52 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 117 Invalid, 0 Unknown, 45 Unchecked, 0.1s Time] [2022-07-19 10:42:26,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-19 10:42:26,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2022-07-19 10:42:26,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.125) internal successors, (36), 32 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-19 10:42:26,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2022-07-19 10:42:26,170 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 21 [2022-07-19 10:42:26,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:42:26,170 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2022-07-19 10:42:26,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 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-19 10:42:26,170 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-07-19 10:42:26,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-19 10:42:26,171 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:42:26,171 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:42:26,192 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-19 10:42:26,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:42:26,388 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:42:26,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:42:26,388 INFO L85 PathProgramCache]: Analyzing trace with hash -2132829117, now seen corresponding path program 5 times [2022-07-19 10:42:26,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:42:26,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412957308] [2022-07-19 10:42:26,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:42:26,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:42:26,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:42:26,451 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:42:26,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:42:26,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412957308] [2022-07-19 10:42:26,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412957308] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:42:26,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1405382923] [2022-07-19 10:42:26,451 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-19 10:42:26,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:42:26,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:42:26,452 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-19 10:42:26,453 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-19 10:42:26,503 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-07-19 10:42:26,503 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:42:26,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-19 10:42:26,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:42:26,561 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:42:26,562 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:42:26,602 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:42:26,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1405382923] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:42:26,602 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:42:26,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-07-19 10:42:26,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944349889] [2022-07-19 10:42:26,602 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:42:26,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-19 10:42:26,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:42:26,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-19 10:42:26,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-07-19 10:42:26,604 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:42:26,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:42:26,785 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2022-07-19 10:42:26,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 10:42:26,786 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-19 10:42:26,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:42:26,786 INFO L225 Difference]: With dead ends: 41 [2022-07-19 10:42:26,786 INFO L226 Difference]: Without dead ends: 37 [2022-07-19 10:42:26,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2022-07-19 10:42:26,787 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 29 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:42:26,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 37 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:42:26,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-07-19 10:42:26,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 25. [2022-07-19 10:42:26,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.125) internal successors, (27), 24 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-19 10:42:26,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-07-19 10:42:26,792 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 23 [2022-07-19 10:42:26,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:42:26,793 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-07-19 10:42:26,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:42:26,793 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-07-19 10:42:26,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-19 10:42:26,793 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:42:26,794 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:42:26,811 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-19 10:42:26,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:42:27,000 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:42:27,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:42:27,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1038837147, now seen corresponding path program 6 times [2022-07-19 10:42:27,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:42:27,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232967322] [2022-07-19 10:42:27,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:42:27,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:42:27,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:42:27,089 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:42:27,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:42:27,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232967322] [2022-07-19 10:42:27,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232967322] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:42:27,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428138625] [2022-07-19 10:42:27,090 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-19 10:42:27,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:42:27,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:42:27,091 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-19 10:42:27,092 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-19 10:42:27,150 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-07-19 10:42:27,150 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:42:27,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-19 10:42:27,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:42:27,206 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:42:27,207 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:42:27,237 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:42:27,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [428138625] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:42:27,237 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:42:27,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-07-19 10:42:27,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798276919] [2022-07-19 10:42:27,238 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:42:27,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-19 10:42:27,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:42:27,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-19 10:42:27,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-07-19 10:42:27,239 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:42:27,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:42:27,344 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2022-07-19 10:42:27,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-19 10:42:27,345 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 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 24 [2022-07-19 10:42:27,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:42:27,345 INFO L225 Difference]: With dead ends: 45 [2022-07-19 10:42:27,345 INFO L226 Difference]: Without dead ends: 30 [2022-07-19 10:42:27,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2022-07-19 10:42:27,346 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 35 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:42:27,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 27 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:42:27,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-19 10:42:27,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2022-07-19 10:42:27,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:42:27,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2022-07-19 10:42:27,351 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 24 [2022-07-19 10:42:27,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:42:27,352 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2022-07-19 10:42:27,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:42:27,352 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-07-19 10:42:27,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-19 10:42:27,352 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:42:27,353 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:42:27,379 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-19 10:42:27,575 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,SelfDestructingSolverStorable9 [2022-07-19 10:42:27,576 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:42:27,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:42:27,576 INFO L85 PathProgramCache]: Analyzing trace with hash -2121994781, now seen corresponding path program 7 times [2022-07-19 10:42:27,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:42:27,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141801474] [2022-07-19 10:42:27,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:42:27,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:42:27,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:42:28,140 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:42:28,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:42:28,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141801474] [2022-07-19 10:42:28,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141801474] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:42:28,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1035407149] [2022-07-19 10:42:28,141 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-19 10:42:28,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:42:28,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:42:28,143 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-19 10:42:28,144 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-19 10:42:28,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:42:28,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 51 conjunts are in the unsatisfiable core [2022-07-19 10:42:28,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:42:28,218 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 11 treesize of output 7 [2022-07-19 10:42:28,221 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 10 treesize of output 8 [2022-07-19 10:42:28,230 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 14 treesize of output 16 [2022-07-19 10:42:28,261 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 14 treesize of output 16 [2022-07-19 10:42:28,294 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 14 treesize of output 16 [2022-07-19 10:42:28,414 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-07-19 10:42:28,512 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-19 10:42:28,513 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 43 [2022-07-19 10:42:28,623 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-19 10:42:28,623 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 43 [2022-07-19 10:42:28,710 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-19 10:42:28,710 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 34 [2022-07-19 10:42:28,738 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:42:28,738 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:42:35,540 WARN L833 $PredicateComparison]: unable to prove that (forall ((~N~0 Int)) (or (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_89| Int) (|v_ULTIMATE.start_main_~i~0#1_87| Int) (v_ArrVal_302 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_92| Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_302))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse2 (select v_ArrVal_302 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_92| 4))))) (let ((.cse0 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_89| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse1 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse3 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_87| 4))))) (or (not (= .cse0 4)) (not (= .cse1 4)) (not (= 4 .cse2)) (= (* ~N~0 4) (+ .cse1 .cse0 .cse3 .cse2))))))))) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0)))) is different from false [2022-07-19 10:42:35,586 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_89| Int) (|v_ULTIMATE.start_main_~i~0#1_87| Int) (v_ArrVal_302 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_92| Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_302))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse2 (select v_ArrVal_302 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_92| 4))))) (let ((.cse0 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_89| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse1 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse3 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_87| 4))))) (or (not (= .cse0 4)) (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0)) (not (= .cse1 4)) (not (= 4 .cse2)) (= (* ~N~0 4) (+ .cse1 .cse0 .cse3 .cse2))))))))) is different from false [2022-07-19 10:42:35,660 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_89| Int) (|v_ULTIMATE.start_main_~i~0#1_87| Int) (v_ArrVal_302 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_92| Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_302))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse2 (select v_ArrVal_302 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_92| 4))))) (let ((.cse0 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_89| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse1 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse3 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_87| 4))))) (or (not (= .cse0 4)) (not (= .cse1 4)) (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (= 4 .cse2)) (= (* ~N~0 4) (+ .cse1 .cse0 .cse3 .cse2)) (not (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0))))))))) is different from false [2022-07-19 10:42:35,722 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-07-19 10:42:35,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1035407149] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:42:35,722 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:42:35,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 15] total 42 [2022-07-19 10:42:35,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137369184] [2022-07-19 10:42:35,723 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:42:35,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-07-19 10:42:35,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:42:35,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-19 10:42:35,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1330, Unknown=7, NotChecked=228, Total=1722 [2022-07-19 10:42:35,725 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 42 states, 42 states have (on average 1.5476190476190477) internal successors, (65), 42 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:42:35,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:42:35,984 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2022-07-19 10:42:35,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-19 10:42:35,985 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.5476190476190477) internal successors, (65), 42 states have internal predecessors, (65), 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 26 [2022-07-19 10:42:35,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:42:35,985 INFO L225 Difference]: With dead ends: 45 [2022-07-19 10:42:35,985 INFO L226 Difference]: Without dead ends: 41 [2022-07-19 10:42:35,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=204, Invalid=1523, Unknown=7, NotChecked=246, Total=1980 [2022-07-19 10:42:35,987 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 9 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 223 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:42:35,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 126 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 178 Invalid, 0 Unknown, 223 Unchecked, 0.1s Time] [2022-07-19 10:42:35,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-07-19 10:42:35,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2022-07-19 10:42:35,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 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-19 10:42:35,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2022-07-19 10:42:35,993 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 26 [2022-07-19 10:42:35,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:42:35,993 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2022-07-19 10:42:35,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 1.5476190476190477) internal successors, (65), 42 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:42:35,994 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2022-07-19 10:42:35,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-19 10:42:35,994 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:42:35,994 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:42:36,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-19 10:42:36,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:42:36,219 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:42:36,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:42:36,219 INFO L85 PathProgramCache]: Analyzing trace with hash -2064736479, now seen corresponding path program 2 times [2022-07-19 10:42:36,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:42:36,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312782094] [2022-07-19 10:42:36,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:42:36,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:42:36,241 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 10:42:36,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1406914970] [2022-07-19 10:42:36,241 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 10:42:36,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:42:36,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:42:36,243 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:42:36,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-19 10:42:36,314 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 10:42:36,314 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:42:36,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-19 10:42:36,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:42:36,320 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 10 treesize of output 8 [2022-07-19 10:42:36,351 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-19 10:42:36,389 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 16 treesize of output 18 [2022-07-19 10:42:36,411 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 16 treesize of output 18 [2022-07-19 10:42:36,434 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-19 10:42:36,456 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:42:36,456 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:42:36,489 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_351 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_351) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 4)) is different from false [2022-07-19 10:42:36,496 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_351 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_351) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4)) is different from false [2022-07-19 10:42:36,505 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_351 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_351) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4)) is different from false [2022-07-19 10:42:36,514 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 10:42:36,517 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-07-19 10:42:36,523 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 10:42:36,524 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 38 [2022-07-19 10:42:36,528 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 11 treesize of output 7 [2022-07-19 10:42:36,555 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2022-07-19 10:42:36,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:42:36,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312782094] [2022-07-19 10:42:36,556 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 10:42:36,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406914970] [2022-07-19 10:42:36,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406914970] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:42:36,556 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 10:42:36,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2022-07-19 10:42:36,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149641172] [2022-07-19 10:42:36,557 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 10:42:36,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-19 10:42:36,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:42:36,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-19 10:42:36,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=128, Unknown=3, NotChecked=72, Total=240 [2022-07-19 10:42:36,558 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:42:36,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:42:36,756 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2022-07-19 10:42:36,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-19 10:42:36,756 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 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 26 [2022-07-19 10:42:36,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:42:36,757 INFO L225 Difference]: With dead ends: 49 [2022-07-19 10:42:36,757 INFO L226 Difference]: Without dead ends: 42 [2022-07-19 10:42:36,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 6 SemanticMatches, 19 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=250, Unknown=3, NotChecked=102, Total=420 [2022-07-19 10:42:36,758 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 17 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 74 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:42:36,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 56 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 173 Invalid, 0 Unknown, 74 Unchecked, 0.1s Time] [2022-07-19 10:42:36,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-07-19 10:42:36,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2022-07-19 10:42:36,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.1) internal successors, (44), 40 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-19 10:42:36,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2022-07-19 10:42:36,772 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 26 [2022-07-19 10:42:36,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:42:36,773 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2022-07-19 10:42:36,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:42:36,773 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2022-07-19 10:42:36,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-19 10:42:36,776 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:42:36,776 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:42:36,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-19 10:42:36,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-19 10:42:36,983 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:42:36,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:42:36,984 INFO L85 PathProgramCache]: Analyzing trace with hash 640571873, now seen corresponding path program 8 times [2022-07-19 10:42:36,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:42:36,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832345242] [2022-07-19 10:42:36,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:42:36,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:42:36,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:42:37,065 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:42:37,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:42:37,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832345242] [2022-07-19 10:42:37,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832345242] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:42:37,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2115270297] [2022-07-19 10:42:37,065 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 10:42:37,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:42:37,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:42:37,068 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:42:37,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-19 10:42:37,138 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 10:42:37,139 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:42:37,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-19 10:42:37,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:42:37,235 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:42:37,236 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:42:37,285 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:42:37,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2115270297] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:42:37,285 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:42:37,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-07-19 10:42:37,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871833585] [2022-07-19 10:42:37,285 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:42:37,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-19 10:42:37,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:42:37,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-19 10:42:37,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-07-19 10:42:37,286 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:42:37,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:42:37,531 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2022-07-19 10:42:37,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-19 10:42:37,532 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 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-19 10:42:37,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:42:37,532 INFO L225 Difference]: With dead ends: 49 [2022-07-19 10:42:37,532 INFO L226 Difference]: Without dead ends: 45 [2022-07-19 10:42:37,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2022-07-19 10:42:37,533 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 49 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:42:37,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 36 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 10:42:37,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-07-19 10:42:37,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 30. [2022-07-19 10:42:37,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 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-19 10:42:37,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2022-07-19 10:42:37,538 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 28 [2022-07-19 10:42:37,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:42:37,539 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2022-07-19 10:42:37,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:42:37,540 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-07-19 10:42:37,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-19 10:42:37,540 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:42:37,540 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:42:37,558 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-07-19 10:42:37,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-19 10:42:37,743 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:42:37,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:42:37,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1478838205, now seen corresponding path program 9 times [2022-07-19 10:42:37,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:42:37,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620645721] [2022-07-19 10:42:37,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:42:37,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:42:37,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:42:37,820 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 15 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:42:37,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:42:37,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620645721] [2022-07-19 10:42:37,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620645721] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:42:37,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679020036] [2022-07-19 10:42:37,821 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-19 10:42:37,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:42:37,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:42:37,824 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:42:37,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-19 10:42:37,912 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-07-19 10:42:37,912 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:42:37,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-19 10:42:37,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:42:38,003 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:42:38,003 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:42:38,041 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:42:38,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [679020036] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:42:38,041 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:42:38,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-07-19 10:42:38,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798637257] [2022-07-19 10:42:38,042 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:42:38,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-19 10:42:38,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:42:38,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-19 10:42:38,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-07-19 10:42:38,043 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:42:38,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:42:38,152 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2022-07-19 10:42:38,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-19 10:42:38,153 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-19 10:42:38,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:42:38,153 INFO L225 Difference]: With dead ends: 53 [2022-07-19 10:42:38,153 INFO L226 Difference]: Without dead ends: 35 [2022-07-19 10:42:38,154 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2022-07-19 10:42:38,154 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 38 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:42:38,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 33 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:42:38,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-07-19 10:42:38,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2022-07-19 10:42:38,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:42:38,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2022-07-19 10:42:38,159 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 29 [2022-07-19 10:42:38,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:42:38,159 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2022-07-19 10:42:38,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:42:38,160 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2022-07-19 10:42:38,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-19 10:42:38,160 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:42:38,160 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:42:38,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-19 10:42:38,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-19 10:42:38,361 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:42:38,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:42:38,361 INFO L85 PathProgramCache]: Analyzing trace with hash -2018974843, now seen corresponding path program 10 times [2022-07-19 10:42:38,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:42:38,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624996040] [2022-07-19 10:42:38,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:42:38,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:42:38,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:42:38,803 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:42:38,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:42:38,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624996040] [2022-07-19 10:42:38,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624996040] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:42:38,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120832370] [2022-07-19 10:42:38,804 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-19 10:42:38,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:42:38,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:42:38,805 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:42:38,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-19 10:42:38,861 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-19 10:42:38,862 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:42:38,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 58 conjunts are in the unsatisfiable core [2022-07-19 10:42:38,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:42:38,874 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 11 treesize of output 7 [2022-07-19 10:42:38,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:42:38,915 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 14 treesize of output 16 [2022-07-19 10:42:38,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:42:38,960 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 14 treesize of output 16 [2022-07-19 10:42:38,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:42:38,998 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 14 treesize of output 16 [2022-07-19 10:42:39,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:42:39,041 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 14 treesize of output 16 [2022-07-19 10:42:39,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:42:39,200 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-07-19 10:42:39,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:42:39,333 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-19 10:42:39,334 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 45 [2022-07-19 10:42:39,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:42:39,494 INFO L356 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2022-07-19 10:42:39,495 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 94 treesize of output 63 [2022-07-19 10:42:39,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:42:39,669 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-19 10:42:39,670 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 43 [2022-07-19 10:42:39,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:42:39,796 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-19 10:42:39,796 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 40 [2022-07-19 10:42:39,842 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:42:39,842 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:43:11,107 WARN L833 $PredicateComparison]: unable to prove that (forall ((~N~0 Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_146| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_148| Int) (|v_ULTIMATE.start_main_~i~0#1_153| Int) (|v_ULTIMATE.start_main_~i~0#1_150| Int) (v_ArrVal_487 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_487))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse6 (select v_ArrVal_487 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_153| 4))))) (let ((.cse3 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_150| 4))))) (let ((.cse5 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_148| 4))))) (let ((.cse4 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_146| 4))))) (or (let ((.cse1 (* ~N~0 4)) (.cse0 (+ .cse2 .cse3 .cse4 .cse5 .cse6))) (and (<= .cse0 .cse1) (<= .cse1 .cse0))) (not (= .cse5 4)) (not (= .cse4 4)) (not (= 4 .cse6)) (not (= .cse3 4)))))))))) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0)))) is different from false [2022-07-19 10:43:14,076 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_146| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_148| Int) (|v_ULTIMATE.start_main_~i~0#1_153| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_150| Int) (v_ArrVal_487 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_487))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse6 (select v_ArrVal_487 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_153| 4))))) (let ((.cse3 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_150| 4))))) (let ((.cse5 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_148| 4))))) (let ((.cse4 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_146| 4))))) (or (let ((.cse1 (* ~N~0 4)) (.cse0 (+ .cse2 .cse3 .cse4 .cse5 .cse6))) (and (<= .cse0 .cse1) (<= .cse1 .cse0))) (not (= .cse5 4)) (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0)) (not (= .cse4 4)) (not (= 4 .cse6)) (not (= .cse3 4)))))))))) is different from false [2022-07-19 10:43:20,966 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_146| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_148| Int) (|v_ULTIMATE.start_main_~i~0#1_153| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_150| Int) (v_ArrVal_487 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_487))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse6 (select v_ArrVal_487 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_153| 4))))) (let ((.cse3 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_150| 4))))) (let ((.cse5 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_148| 4))))) (let ((.cse4 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_146| 4))))) (or (let ((.cse1 (* ~N~0 4)) (.cse0 (+ .cse2 .cse3 .cse4 .cse5 .cse6))) (and (<= .cse0 .cse1) (<= .cse1 .cse0))) (not (= .cse5 4)) (not (= .cse4 4)) (not (= 4 .cse6)) (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (= .cse3 4)) (not (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0)))))))))) is different from false [2022-07-19 10:43:30,311 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_146| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_148| Int) (|v_ULTIMATE.start_main_~i~0#1_153| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_150| Int) (v_ArrVal_487 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_487))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse6 (select v_ArrVal_487 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_153| 4))))) (let ((.cse3 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_150| 4))))) (let ((.cse5 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_148| 4))))) (let ((.cse4 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_146| 4))))) (or (let ((.cse1 (* ~N~0 4)) (.cse0 (+ .cse2 .cse3 .cse4 .cse5 .cse6))) (and (<= .cse0 .cse1) (<= .cse1 .cse0))) (not (= .cse5 4)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 4) ~N~0) (not (= .cse4 4)) (not (= 4 .cse6)) (not (= .cse3 4)) (not (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0)))))))))) is different from false [2022-07-19 10:43:36,163 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2022-07-19 10:43:36,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1120832370] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:43:36,164 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:43:36,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18, 18] total 52 [2022-07-19 10:43:36,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238783914] [2022-07-19 10:43:36,164 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:43:36,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-07-19 10:43:36,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:43:36,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-07-19 10:43:36,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=2076, Unknown=15, NotChecked=380, Total=2652 [2022-07-19 10:43:36,166 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 52 states, 52 states have (on average 1.5384615384615385) internal successors, (80), 52 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:43:36,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:43:36,748 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2022-07-19 10:43:36,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-19 10:43:36,749 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 1.5384615384615385) internal successors, (80), 52 states have internal predecessors, (80), 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-19 10:43:36,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:43:36,750 INFO L225 Difference]: With dead ends: 53 [2022-07-19 10:43:36,750 INFO L226 Difference]: Without dead ends: 49 [2022-07-19 10:43:36,751 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 33 SyntacticMatches, 6 SemanticMatches, 54 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 856 ImplicationChecksByTransitivity, 26.0s TimeCoverageRelationStatistics Valid=232, Invalid=2421, Unknown=15, NotChecked=412, Total=3080 [2022-07-19 10:43:36,751 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 10 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 310 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:43:36,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 117 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 241 Invalid, 0 Unknown, 310 Unchecked, 0.2s Time] [2022-07-19 10:43:36,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-07-19 10:43:36,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2022-07-19 10:43:36,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 45 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:43:36,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2022-07-19 10:43:36,764 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 31 [2022-07-19 10:43:36,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:43:36,765 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2022-07-19 10:43:36,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 1.5384615384615385) internal successors, (80), 52 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:43:36,765 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2022-07-19 10:43:36,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-19 10:43:36,766 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:43:36,766 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:43:36,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-19 10:43:36,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-19 10:43:36,979 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:43:36,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:43:36,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1961716541, now seen corresponding path program 3 times [2022-07-19 10:43:36,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:43:36,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211511011] [2022-07-19 10:43:36,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:43:36,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:43:36,992 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 10:43:36,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1586938958] [2022-07-19 10:43:36,993 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-19 10:43:36,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:43:36,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:43:36,994 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:43:37,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-19 10:43:37,078 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-07-19 10:43:37,079 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:43:37,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-19 10:43:37,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:43:37,084 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 10 treesize of output 8 [2022-07-19 10:43:37,098 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-19 10:43:37,190 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 18 treesize of output 20 [2022-07-19 10:43:37,215 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 18 treesize of output 20 [2022-07-19 10:43:37,244 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 18 treesize of output 20 [2022-07-19 10:43:37,273 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 10:43:37,273 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2022-07-19 10:43:37,311 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-19 10:43:37,312 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:43:37,363 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_547 (Array Int Int))) (or (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~N~0) (not (< |ULTIMATE.start_main_~i~0#1| c_~N~0)) (= 4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_547) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))))) is different from false [2022-07-19 10:43:37,481 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 10:43:37,481 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-07-19 10:43:37,487 INFO L356 Elim1Store]: treesize reduction 12, result has 25.0 percent of original size [2022-07-19 10:43:37,488 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 30 [2022-07-19 10:43:37,497 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 16 trivial. 13 not checked. [2022-07-19 10:43:37,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:43:37,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211511011] [2022-07-19 10:43:37,498 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 10:43:37,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1586938958] [2022-07-19 10:43:37,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1586938958] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:43:37,498 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 10:43:37,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2022-07-19 10:43:37,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894679907] [2022-07-19 10:43:37,498 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 10:43:37,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-19 10:43:37,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:43:37,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-19 10:43:37,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=129, Unknown=6, NotChecked=24, Total=210 [2022-07-19 10:43:37,499 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:43:37,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:43:37,585 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2022-07-19 10:43:37,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 10:43:37,585 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 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-19 10:43:37,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:43:37,586 INFO L225 Difference]: With dead ends: 55 [2022-07-19 10:43:37,586 INFO L226 Difference]: Without dead ends: 51 [2022-07-19 10:43:37,586 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=145, Unknown=6, NotChecked=26, Total=240 [2022-07-19 10:43:37,587 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 61 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:43:37,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 38 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 61 Unchecked, 0.0s Time] [2022-07-19 10:43:37,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-07-19 10:43:37,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-07-19 10:43:37,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.14) internal successors, (57), 50 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:43:37,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2022-07-19 10:43:37,595 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 31 [2022-07-19 10:43:37,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:43:37,595 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2022-07-19 10:43:37,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:43:37,596 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2022-07-19 10:43:37,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-19 10:43:37,596 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:43:37,596 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:43:37,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-19 10:43:37,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:43:37,797 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:43:37,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:43:37,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1399241145, now seen corresponding path program 11 times [2022-07-19 10:43:37,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:43:37,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740777550] [2022-07-19 10:43:37,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:43:37,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:43:37,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:43:37,929 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 9 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:43:37,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:43:37,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740777550] [2022-07-19 10:43:37,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740777550] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:43:37,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1761108641] [2022-07-19 10:43:37,931 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-19 10:43:37,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:43:37,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:43:37,932 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:43:37,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-19 10:43:38,018 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-07-19 10:43:38,018 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:43:38,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-19 10:43:38,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:43:38,137 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:43:38,137 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:43:38,185 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:43:38,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1761108641] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:43:38,185 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:43:38,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2022-07-19 10:43:38,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925339435] [2022-07-19 10:43:38,185 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:43:38,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-19 10:43:38,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:43:38,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-19 10:43:38,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2022-07-19 10:43:38,186 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand has 20 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:43:38,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:43:38,451 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2022-07-19 10:43:38,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-19 10:43:38,451 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 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 33 [2022-07-19 10:43:38,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:43:38,452 INFO L225 Difference]: With dead ends: 69 [2022-07-19 10:43:38,452 INFO L226 Difference]: Without dead ends: 65 [2022-07-19 10:43:38,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=206, Invalid=664, Unknown=0, NotChecked=0, Total=870 [2022-07-19 10:43:38,453 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 53 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:43:38,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 33 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 10:43:38,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-07-19 10:43:38,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 40. [2022-07-19 10:43:38,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 39 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-19 10:43:38,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2022-07-19 10:43:38,460 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 33 [2022-07-19 10:43:38,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:43:38,460 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2022-07-19 10:43:38,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:43:38,460 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2022-07-19 10:43:38,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-19 10:43:38,461 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:43:38,461 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:43:38,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-07-19 10:43:38,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-19 10:43:38,671 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:43:38,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:43:38,672 INFO L85 PathProgramCache]: Analyzing trace with hash 981485409, now seen corresponding path program 12 times [2022-07-19 10:43:38,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:43:38,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270389976] [2022-07-19 10:43:38,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:43:38,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:43:38,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:43:38,770 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 25 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:43:38,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:43:38,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270389976] [2022-07-19 10:43:38,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270389976] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:43:38,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [45887203] [2022-07-19 10:43:38,771 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-19 10:43:38,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:43:38,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:43:38,772 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:43:38,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-19 10:43:38,869 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-07-19 10:43:38,869 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:43:38,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-19 10:43:38,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:43:38,999 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 35 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:43:38,999 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:43:39,054 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 35 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:43:39,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [45887203] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:43:39,055 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:43:39,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2022-07-19 10:43:39,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206000092] [2022-07-19 10:43:39,055 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:43:39,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-19 10:43:39,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:43:39,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-19 10:43:39,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2022-07-19 10:43:39,056 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand has 20 states, 20 states have (on average 2.75) internal successors, (55), 20 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:43:39,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:43:39,252 INFO L93 Difference]: Finished difference Result 78 states and 90 transitions. [2022-07-19 10:43:39,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-19 10:43:39,252 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.75) internal successors, (55), 20 states have internal predecessors, (55), 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 34 [2022-07-19 10:43:39,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:43:39,253 INFO L225 Difference]: With dead ends: 78 [2022-07-19 10:43:39,253 INFO L226 Difference]: Without dead ends: 50 [2022-07-19 10:43:39,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=439, Unknown=0, NotChecked=0, Total=600 [2022-07-19 10:43:39,254 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 60 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:43:39,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 30 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:43:39,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-07-19 10:43:39,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2022-07-19 10:43:39,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.146341463414634) internal successors, (47), 41 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:43:39,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2022-07-19 10:43:39,264 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 34 [2022-07-19 10:43:39,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:43:39,264 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2022-07-19 10:43:39,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.75) internal successors, (55), 20 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:43:39,264 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-07-19 10:43:39,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-19 10:43:39,266 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:43:39,266 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:43:39,286 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-07-19 10:43:39,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-19 10:43:39,474 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:43:39,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:43:39,474 INFO L85 PathProgramCache]: Analyzing trace with hash -596322977, now seen corresponding path program 13 times [2022-07-19 10:43:39,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:43:39,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941484966] [2022-07-19 10:43:39,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:43:39,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:43:39,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:43:40,142 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:43:40,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:43:40,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941484966] [2022-07-19 10:43:40,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941484966] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:43:40,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074950139] [2022-07-19 10:43:40,142 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-19 10:43:40,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:43:40,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:43:40,144 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:43:40,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-19 10:43:40,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:43:40,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 73 conjunts are in the unsatisfiable core [2022-07-19 10:43:40,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:43:40,221 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 10 treesize of output 8 [2022-07-19 10:43:40,224 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-19 10:43:40,233 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 14 treesize of output 16 [2022-07-19 10:43:40,249 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 14 treesize of output 16 [2022-07-19 10:43:40,263 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 14 treesize of output 16 [2022-07-19 10:43:40,277 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 14 treesize of output 16 [2022-07-19 10:43:40,295 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 14 treesize of output 16 [2022-07-19 10:43:40,446 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-07-19 10:43:40,550 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-19 10:43:40,550 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 43 [2022-07-19 10:43:40,686 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-19 10:43:40,686 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2022-07-19 10:43:40,823 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-19 10:43:40,823 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 43 [2022-07-19 10:43:40,966 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-19 10:43:40,967 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 43 [2022-07-19 10:43:41,067 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-19 10:43:41,068 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 34 [2022-07-19 10:43:41,104 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:43:41,104 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:45:13,442 WARN L833 $PredicateComparison]: unable to prove that (forall ((~N~0 Int)) (or (forall ((v_ArrVal_710 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_223| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_225| Int) (|v_ULTIMATE.start_main_~i~0#1_221| Int) (|v_ULTIMATE.start_main_~i~0#1_228| Int) (|v_ULTIMATE.start_main_~i~0#1_219| Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_710))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select v_ArrVal_710 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_228| 4)))) (.cse6 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse1 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_225| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse1 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_223| 4))))) (let ((.cse7 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse1 .cse6 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_221| 4))))) (let ((.cse3 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse1 .cse6 .cse7 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_219| 4))))) (or (not (= 4 .cse0)) (not (= .cse1 4)) (not (= .cse2 4)) (not (= .cse3 4)) (let ((.cse5 (* ~N~0 4)) (.cse4 (+ .cse3 .cse2 .cse1 .cse6 .cse7 .cse0))) (and (<= .cse4 .cse5) (<= .cse5 .cse4))) (not (= .cse7 4))))))))))) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0)))) is different from false [2022-07-19 10:45:40,256 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_710 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_223| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_225| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_221| Int) (|v_ULTIMATE.start_main_~i~0#1_228| Int) (|v_ULTIMATE.start_main_~i~0#1_219| Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_710))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select v_ArrVal_710 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_228| 4)))) (.cse6 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse1 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_225| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse1 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_223| 4))))) (let ((.cse7 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse1 .cse6 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_221| 4))))) (let ((.cse3 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse1 .cse6 .cse7 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_219| 4))))) (or (not (= 4 .cse0)) (not (= .cse1 4)) (not (= .cse2 4)) (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0)) (not (= .cse3 4)) (let ((.cse5 (* ~N~0 4)) (.cse4 (+ .cse3 .cse2 .cse1 .cse6 .cse7 .cse0))) (and (<= .cse4 .cse5) (<= .cse5 .cse4))) (not (= .cse7 4))))))))))) is different from false