./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/s5if.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ae007674 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/s5if.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 b618695aa08df106816e7defd71220f009a5c8c09539ff7c8c29235c85f2ce8d --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ae00767 [2021-12-27 21:50:54,208 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-27 21:50:54,210 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-27 21:50:54,243 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-27 21:50:54,243 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-27 21:50:54,246 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-27 21:50:54,247 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-27 21:50:54,252 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-27 21:50:54,256 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-27 21:50:54,260 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-27 21:50:54,261 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-27 21:50:54,262 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-27 21:50:54,262 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-27 21:50:54,264 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-27 21:50:54,265 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-27 21:50:54,268 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-27 21:50:54,269 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-27 21:50:54,269 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-27 21:50:54,271 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-27 21:50:54,275 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-27 21:50:54,277 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-27 21:50:54,277 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-27 21:50:54,279 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-27 21:50:54,280 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-27 21:50:54,282 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-27 21:50:54,282 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-27 21:50:54,282 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-27 21:50:54,283 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-27 21:50:54,284 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-27 21:50:54,284 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-27 21:50:54,284 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-27 21:50:54,285 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-27 21:50:54,286 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-27 21:50:54,286 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-27 21:50:54,287 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-27 21:50:54,287 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-27 21:50:54,288 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-27 21:50:54,288 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-27 21:50:54,288 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-27 21:50:54,289 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-27 21:50:54,290 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-27 21:50:54,296 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-27 21:50:54,323 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-27 21:50:54,323 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-27 21:50:54,324 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-27 21:50:54,324 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-27 21:50:54,325 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-27 21:50:54,325 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-27 21:50:54,326 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-27 21:50:54,326 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-27 21:50:54,326 INFO L138 SettingsManager]: * Use SBE=true [2021-12-27 21:50:54,326 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-27 21:50:54,327 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-27 21:50:54,327 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-27 21:50:54,327 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-27 21:50:54,327 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-27 21:50:54,327 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-27 21:50:54,327 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-27 21:50:54,327 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-27 21:50:54,328 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-27 21:50:54,328 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-27 21:50:54,328 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-27 21:50:54,328 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-27 21:50:54,328 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-27 21:50:54,328 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-27 21:50:54,328 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-27 21:50:54,329 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-27 21:50:54,329 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-27 21:50:54,329 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-27 21:50:54,333 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-27 21:50:54,333 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-27 21:50:54,333 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-27 21:50:54,333 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-27 21:50:54,333 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-27 21:50:54,334 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-27 21:50:54,334 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 -> b618695aa08df106816e7defd71220f009a5c8c09539ff7c8c29235c85f2ce8d [2021-12-27 21:50:54,578 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-27 21:50:54,592 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-27 21:50:54,594 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-27 21:50:54,595 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-27 21:50:54,596 INFO L275 PluginConnector]: CDTParser initialized [2021-12-27 21:50:54,597 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/s5if.c [2021-12-27 21:50:54,642 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89e95ce31/6046c953c95f47ec988106376b034cdd/FLAG1d779695d [2021-12-27 21:50:54,995 INFO L306 CDTParser]: Found 1 translation units. [2021-12-27 21:50:54,996 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s5if.c [2021-12-27 21:50:55,001 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89e95ce31/6046c953c95f47ec988106376b034cdd/FLAG1d779695d [2021-12-27 21:50:55,014 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89e95ce31/6046c953c95f47ec988106376b034cdd [2021-12-27 21:50:55,016 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-27 21:50:55,019 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-27 21:50:55,020 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-27 21:50:55,020 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-27 21:50:55,022 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-27 21:50:55,022 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:50:55" (1/1) ... [2021-12-27 21:50:55,023 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b2bf17c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:50:55, skipping insertion in model container [2021-12-27 21:50:55,023 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:50:55" (1/1) ... [2021-12-27 21:50:55,028 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-27 21:50:55,037 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-27 21:50:55,147 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/s5if.c[587,600] [2021-12-27 21:50:55,160 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-27 21:50:55,165 INFO L203 MainTranslator]: Completed pre-run [2021-12-27 21:50:55,176 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/s5if.c[587,600] [2021-12-27 21:50:55,188 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-27 21:50:55,197 INFO L208 MainTranslator]: Completed translation [2021-12-27 21:50:55,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:50:55 WrapperNode [2021-12-27 21:50:55,198 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-27 21:50:55,199 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-27 21:50:55,199 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-27 21:50:55,199 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-27 21:50:55,203 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:50:55" (1/1) ... [2021-12-27 21:50:55,212 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:50:55" (1/1) ... [2021-12-27 21:50:55,250 INFO L137 Inliner]: procedures = 17, calls = 30, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 79 [2021-12-27 21:50:55,250 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-27 21:50:55,251 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-27 21:50:55,251 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-27 21:50:55,252 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-27 21:50:55,257 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:50:55" (1/1) ... [2021-12-27 21:50:55,257 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:50:55" (1/1) ... [2021-12-27 21:50:55,269 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:50:55" (1/1) ... [2021-12-27 21:50:55,270 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:50:55" (1/1) ... [2021-12-27 21:50:55,276 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:50:55" (1/1) ... [2021-12-27 21:50:55,283 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:50:55" (1/1) ... [2021-12-27 21:50:55,285 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:50:55" (1/1) ... [2021-12-27 21:50:55,289 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-27 21:50:55,291 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-27 21:50:55,292 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-27 21:50:55,293 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-27 21:50:55,293 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:50:55" (1/1) ... [2021-12-27 21:50:55,298 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-27 21:50:55,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 21:50:55,316 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) [2021-12-27 21:50:55,323 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 [2021-12-27 21:50:55,357 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-27 21:50:55,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-27 21:50:55,358 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-27 21:50:55,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-27 21:50:55,358 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-27 21:50:55,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-27 21:50:55,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-27 21:50:55,359 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-27 21:50:55,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-27 21:50:55,406 INFO L234 CfgBuilder]: Building ICFG [2021-12-27 21:50:55,407 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-27 21:50:55,508 INFO L275 CfgBuilder]: Performing block encoding [2021-12-27 21:50:55,511 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-27 21:50:55,512 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-27 21:50:55,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:50:55 BoogieIcfgContainer [2021-12-27 21:50:55,513 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-27 21:50:55,514 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-27 21:50:55,514 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-27 21:50:55,516 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-27 21:50:55,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:50:55" (1/3) ... [2021-12-27 21:50:55,517 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73bf955f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:50:55, skipping insertion in model container [2021-12-27 21:50:55,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:50:55" (2/3) ... [2021-12-27 21:50:55,518 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73bf955f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:50:55, skipping insertion in model container [2021-12-27 21:50:55,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:50:55" (3/3) ... [2021-12-27 21:50:55,519 INFO L111 eAbstractionObserver]: Analyzing ICFG s5if.c [2021-12-27 21:50:55,523 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-27 21:50:55,523 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-27 21:50:55,567 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-27 21:50:55,573 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-27 21:50:55,573 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-27 21:50:55,588 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) [2021-12-27 21:50:55,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-27 21:50:55,599 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:50:55,600 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:50:55,601 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:50:55,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:50:55,614 INFO L85 PathProgramCache]: Analyzing trace with hash 356661439, now seen corresponding path program 1 times [2021-12-27 21:50:55,620 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:50:55,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708575534] [2021-12-27 21:50:55,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:50:55,621 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:50:55,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:50:55,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:50:55,777 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:50:55,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708575534] [2021-12-27 21:50:55,778 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708575534] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:50:55,778 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:50:55,779 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-27 21:50:55,780 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975351404] [2021-12-27 21:50:55,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:50:55,783 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-27 21:50:55,783 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:50:55,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-27 21:50:55,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-27 21:50:55,802 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) [2021-12-27 21:50:55,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:50:55,811 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2021-12-27 21:50:55,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-27 21:50:55,812 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 [2021-12-27 21:50:55,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:50:55,817 INFO L225 Difference]: With dead ends: 34 [2021-12-27 21:50:55,817 INFO L226 Difference]: Without dead ends: 15 [2021-12-27 21:50:55,819 INFO L932 BasicCegarLoop]: 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 [2021-12-27 21:50:55,821 INFO L933 BasicCegarLoop]: 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 [2021-12-27 21:50:55,822 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-27 21:50:55,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2021-12-27 21:50:55,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2021-12-27 21:50:55,840 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) [2021-12-27 21:50:55,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2021-12-27 21:50:55,852 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 11 [2021-12-27 21:50:55,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:50:55,853 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2021-12-27 21:50:55,853 INFO L471 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) [2021-12-27 21:50:55,853 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2021-12-27 21:50:55,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-27 21:50:55,854 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:50:55,854 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:50:55,854 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-27 21:50:55,854 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:50:55,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:50:55,855 INFO L85 PathProgramCache]: Analyzing trace with hash -452685187, now seen corresponding path program 1 times [2021-12-27 21:50:55,855 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:50:55,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847083254] [2021-12-27 21:50:55,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:50:55,856 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:50:55,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:50:55,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:50:55,933 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:50:55,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847083254] [2021-12-27 21:50:55,933 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847083254] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:50:55,933 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:50:55,933 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-27 21:50:55,934 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566126053] [2021-12-27 21:50:55,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:50:55,935 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-27 21:50:55,935 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:50:55,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-27 21:50:55,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-27 21:50:55,936 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) [2021-12-27 21:50:55,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:50:55,978 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2021-12-27 21:50:55,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-27 21:50:55,978 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 [2021-12-27 21:50:55,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:50:55,979 INFO L225 Difference]: With dead ends: 28 [2021-12-27 21:50:55,979 INFO L226 Difference]: Without dead ends: 20 [2021-12-27 21:50:55,979 INFO L932 BasicCegarLoop]: 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 [2021-12-27 21:50:55,980 INFO L933 BasicCegarLoop]: 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 [2021-12-27 21:50:55,981 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 10 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-27 21:50:55,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-12-27 21:50:55,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2021-12-27 21:50:55,984 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) [2021-12-27 21:50:55,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2021-12-27 21:50:55,985 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2021-12-27 21:50:55,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:50:55,985 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2021-12-27 21:50:55,985 INFO L471 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) [2021-12-27 21:50:55,985 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2021-12-27 21:50:55,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-27 21:50:55,986 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:50:55,986 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:50:55,986 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-27 21:50:55,986 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:50:55,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:50:55,987 INFO L85 PathProgramCache]: Analyzing trace with hash 623611495, now seen corresponding path program 1 times [2021-12-27 21:50:55,987 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:50:55,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514449821] [2021-12-27 21:50:55,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:50:55,987 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:50:56,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:50:56,292 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:50:56,292 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:50:56,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514449821] [2021-12-27 21:50:56,293 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514449821] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-27 21:50:56,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2036610624] [2021-12-27 21:50:56,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:50:56,293 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 21:50:56,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 21:50:56,295 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) [2021-12-27 21:50:56,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-27 21:50:56,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:50:56,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 26 conjunts are in the unsatisfiable core [2021-12-27 21:50:56,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:50:56,416 INFO L387 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 [2021-12-27 21:50:56,423 INFO L387 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 [2021-12-27 21:50:56,459 INFO L387 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 [2021-12-27 21:50:56,581 INFO L387 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 [2021-12-27 21:50:56,718 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:50:56,718 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 21:50:56,938 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-27 21:50:56,939 INFO L387 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 [2021-12-27 21:50:56,943 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-27 21:50:56,945 INFO L387 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 [2021-12-27 21:50:56,949 INFO L387 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 [2021-12-27 21:50:56,965 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:50:56,965 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2036610624] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 21:50:56,965 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-27 21:50:56,966 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 21 [2021-12-27 21:50:56,966 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387182473] [2021-12-27 21:50:56,966 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-27 21:50:56,967 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-12-27 21:50:56,968 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:50:56,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-27 21:50:56,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2021-12-27 21:50:56,970 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 21 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 21 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) [2021-12-27 21:50:57,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:50:57,164 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2021-12-27 21:50:57,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-27 21:50:57,164 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 21 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 16 [2021-12-27 21:50:57,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:50:57,166 INFO L225 Difference]: With dead ends: 46 [2021-12-27 21:50:57,166 INFO L226 Difference]: Without dead ends: 41 [2021-12-27 21:50:57,167 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=146, Invalid=504, Unknown=0, NotChecked=0, Total=650 [2021-12-27 21:50:57,167 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 24 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 39 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:50:57,168 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 44 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 98 Invalid, 0 Unknown, 39 Unchecked, 0.1s Time] [2021-12-27 21:50:57,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2021-12-27 21:50:57,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 26. [2021-12-27 21:50:57,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.28) internal successors, (32), 25 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) [2021-12-27 21:50:57,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2021-12-27 21:50:57,178 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 16 [2021-12-27 21:50:57,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:50:57,179 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2021-12-27 21:50:57,181 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 21 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) [2021-12-27 21:50:57,181 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2021-12-27 21:50:57,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-27 21:50:57,182 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:50:57,182 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:50:57,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-27 21:50:57,400 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 21:50:57,401 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:50:57,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:50:57,401 INFO L85 PathProgramCache]: Analyzing trace with hash 680869797, now seen corresponding path program 1 times [2021-12-27 21:50:57,402 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:50:57,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269002476] [2021-12-27 21:50:57,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:50:57,402 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:50:57,422 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-27 21:50:57,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [880420178] [2021-12-27 21:50:57,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:50:57,427 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 21:50:57,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 21:50:57,428 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) [2021-12-27 21:50:57,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-27 21:50:57,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:50:57,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-27 21:50:57,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:50:57,486 INFO L387 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 [2021-12-27 21:50:57,514 INFO L387 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 [2021-12-27 21:50:57,524 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:50:57,525 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 21:50:57,552 INFO L387 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 [2021-12-27 21:50:57,554 INFO L387 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 [2021-12-27 21:50:57,567 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:50:57,567 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:50:57,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269002476] [2021-12-27 21:50:57,571 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-27 21:50:57,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880420178] [2021-12-27 21:50:57,571 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [880420178] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 21:50:57,571 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-27 21:50:57,572 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2021-12-27 21:50:57,572 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550103306] [2021-12-27 21:50:57,572 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-27 21:50:57,573 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-27 21:50:57,573 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:50:57,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-27 21:50:57,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-12-27 21:50:57,574 INFO L87 Difference]: Start difference. First operand 26 states and 32 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) [2021-12-27 21:50:57,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:50:57,618 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2021-12-27 21:50:57,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-27 21:50:57,618 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 [2021-12-27 21:50:57,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:50:57,619 INFO L225 Difference]: With dead ends: 38 [2021-12-27 21:50:57,620 INFO L226 Difference]: Without dead ends: 26 [2021-12-27 21:50:57,620 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-12-27 21:50:57,624 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 4 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-27 21:50:57,625 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 42 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-27 21:50:57,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-12-27 21:50:57,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2021-12-27 21:50:57,631 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) [2021-12-27 21:50:57,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2021-12-27 21:50:57,633 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 16 [2021-12-27 21:50:57,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:50:57,634 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2021-12-27 21:50:57,634 INFO L471 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) [2021-12-27 21:50:57,636 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2021-12-27 21:50:57,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-27 21:50:57,637 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:50:57,637 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:50:57,656 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-27 21:50:57,851 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2021-12-27 21:50:57,852 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:50:57,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:50:57,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1137819675, now seen corresponding path program 2 times [2021-12-27 21:50:57,853 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:50:57,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375784121] [2021-12-27 21:50:57,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:50:57,853 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:50:57,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:50:57,914 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:50:57,914 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:50:57,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375784121] [2021-12-27 21:50:57,914 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375784121] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-27 21:50:57,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [806389660] [2021-12-27 21:50:57,915 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-27 21:50:57,915 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 21:50:57,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 21:50:57,916 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) [2021-12-27 21:50:57,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-27 21:50:57,955 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-27 21:50:57,956 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-27 21:50:57,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-27 21:50:57,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:50:58,012 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:50:58,013 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 21:50:58,046 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:50:58,047 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [806389660] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 21:50:58,047 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-27 21:50:58,047 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2021-12-27 21:50:58,048 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158602777] [2021-12-27 21:50:58,048 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-27 21:50:58,049 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-27 21:50:58,049 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:50:58,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-27 21:50:58,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-12-27 21:50:58,050 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) [2021-12-27 21:50:58,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:50:58,141 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2021-12-27 21:50:58,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-27 21:50:58,141 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 [2021-12-27 21:50:58,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:50:58,142 INFO L225 Difference]: With dead ends: 33 [2021-12-27 21:50:58,142 INFO L226 Difference]: Without dead ends: 29 [2021-12-27 21:50:58,142 INFO L932 BasicCegarLoop]: 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 [2021-12-27 21:50:58,143 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 28 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:50:58,143 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 32 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:50:58,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-12-27 21:50:58,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 20. [2021-12-27 21:50:58,146 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) [2021-12-27 21:50:58,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2021-12-27 21:50:58,146 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 18 [2021-12-27 21:50:58,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:50:58,146 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2021-12-27 21:50:58,147 INFO L471 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) [2021-12-27 21:50:58,147 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2021-12-27 21:50:58,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-27 21:50:58,147 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:50:58,147 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:50:58,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-27 21:50:58,367 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 21:50:58,369 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:50:58,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:50:58,370 INFO L85 PathProgramCache]: Analyzing trace with hash -479454913, now seen corresponding path program 3 times [2021-12-27 21:50:58,370 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:50:58,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498522592] [2021-12-27 21:50:58,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:50:58,373 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:50:58,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:50:58,416 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:50:58,417 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:50:58,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498522592] [2021-12-27 21:50:58,417 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498522592] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-27 21:50:58,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77503259] [2021-12-27 21:50:58,417 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-27 21:50:58,417 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 21:50:58,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 21:50:58,418 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) [2021-12-27 21:50:58,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-27 21:50:58,458 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-12-27 21:50:58,458 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-27 21:50:58,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-27 21:50:58,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:50:58,512 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:50:58,512 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 21:50:58,549 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:50:58,550 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [77503259] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 21:50:58,550 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-27 21:50:58,550 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2021-12-27 21:50:58,550 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552074844] [2021-12-27 21:50:58,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-27 21:50:58,551 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-27 21:50:58,551 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:50:58,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-27 21:50:58,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-12-27 21:50:58,551 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) [2021-12-27 21:50:58,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:50:58,607 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2021-12-27 21:50:58,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-27 21:50:58,607 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 [2021-12-27 21:50:58,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:50:58,608 INFO L225 Difference]: With dead ends: 37 [2021-12-27 21:50:58,608 INFO L226 Difference]: Without dead ends: 25 [2021-12-27 21:50:58,608 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2021-12-27 21:50:58,609 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 23 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-27 21:50:58,609 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 21 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-27 21:50:58,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-12-27 21:50:58,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2021-12-27 21:50:58,612 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) [2021-12-27 21:50:58,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2021-12-27 21:50:58,612 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 19 [2021-12-27 21:50:58,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:50:58,612 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2021-12-27 21:50:58,613 INFO L471 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) [2021-12-27 21:50:58,613 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2021-12-27 21:50:58,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-27 21:50:58,613 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:50:58,613 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:50:58,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-27 21:50:58,828 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 21:50:58,828 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:50:58,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:50:58,829 INFO L85 PathProgramCache]: Analyzing trace with hash 634982145, now seen corresponding path program 4 times [2021-12-27 21:50:58,829 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:50:58,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233869592] [2021-12-27 21:50:58,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:50:58,829 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:50:58,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:50:59,079 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:50:59,080 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:50:59,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233869592] [2021-12-27 21:50:59,080 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233869592] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-27 21:50:59,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472057974] [2021-12-27 21:50:59,080 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-27 21:50:59,080 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 21:50:59,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 21:50:59,083 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) [2021-12-27 21:50:59,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-27 21:50:59,118 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-27 21:50:59,118 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-27 21:50:59,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 36 conjunts are in the unsatisfiable core [2021-12-27 21:50:59,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:50:59,140 INFO L387 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 [2021-12-27 21:50:59,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 21:50:59,188 INFO L387 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 [2021-12-27 21:50:59,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 21:50:59,234 INFO L387 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 [2021-12-27 21:50:59,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 21:50:59,364 INFO L387 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 [2021-12-27 21:50:59,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 21:50:59,464 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-27 21:50:59,464 INFO L387 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 [2021-12-27 21:50:59,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 21:50:59,599 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-27 21:50:59,599 INFO L387 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 86 treesize of output 38 [2021-12-27 21:50:59,625 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:50:59,626 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 21:51:04,066 WARN L838 $PredicateComparison]: unable to prove that (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 ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_152))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse0 (select .cse4 |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 ((.cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .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 (and (<= (div (+ .cse0 (- 1) .cse1 .cse2) 5) |c_ULTIMATE.start_main_~i~0#1|) (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) (div (+ .cse0 .cse1 .cse2) 5))) (not (= .cse1 5)) (not (= 5 .cse2)))))))) is different from false [2021-12-27 21:51:04,149 WARN L838 $PredicateComparison]: unable to prove that (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 ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_152))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse0 (select .cse4 |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 ((.cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .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 (and (<= (+ 2 |c_ULTIMATE.start_main_~i~0#1|) (div (+ .cse0 .cse1 .cse2) 5)) (<= (div (+ .cse0 (- 1) .cse1 .cse2) 5) (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (not (= .cse1 5)) (not (= 5 .cse2)))))))) is different from false [2021-12-27 21:51:04,256 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2021-12-27 21:51:04,256 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [472057974] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 21:51:04,256 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-27 21:51:04,256 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 32 [2021-12-27 21:51:04,256 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757823894] [2021-12-27 21:51:04,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-27 21:51:04,258 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-12-27 21:51:04,258 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:51:04,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-12-27 21:51:04,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=763, Unknown=4, NotChecked=114, Total=992 [2021-12-27 21:51:04,258 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) [2021-12-27 21:51:04,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:51:04,466 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2021-12-27 21:51:04,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-27 21:51:04,466 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 [2021-12-27 21:51:04,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:51:04,466 INFO L225 Difference]: With dead ends: 36 [2021-12-27 21:51:04,467 INFO L226 Difference]: Without dead ends: 32 [2021-12-27 21:51:04,467 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=162, Invalid=964, Unknown=4, NotChecked=130, Total=1260 [2021-12-27 21:51:04,467 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 7 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 105 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:51:04,468 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 82 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 154 Invalid, 0 Unknown, 105 Unchecked, 0.1s Time] [2021-12-27 21:51:04,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2021-12-27 21:51:04,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2021-12-27 21:51:04,471 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) [2021-12-27 21:51:04,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2021-12-27 21:51:04,471 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 21 [2021-12-27 21:51:04,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:51:04,471 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2021-12-27 21:51:04,471 INFO L471 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) [2021-12-27 21:51:04,472 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2021-12-27 21:51:04,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-27 21:51:04,472 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:51:04,472 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:51:04,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-27 21:51:04,675 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 21:51:04,675 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:51:04,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:51:04,676 INFO L85 PathProgramCache]: Analyzing trace with hash 692240447, now seen corresponding path program 1 times [2021-12-27 21:51:04,676 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:51:04,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226067783] [2021-12-27 21:51:04,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:51:04,676 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:51:04,693 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-27 21:51:04,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [23859696] [2021-12-27 21:51:04,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:51:04,694 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 21:51:04,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 21:51:04,700 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) [2021-12-27 21:51:04,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-27 21:51:04,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:51:04,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-27 21:51:04,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:51:04,779 INFO L387 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 [2021-12-27 21:51:04,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 21:51:04,835 INFO L387 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 [2021-12-27 21:51:04,866 INFO L387 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 [2021-12-27 21:51:04,892 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:51:04,892 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 21:51:04,923 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_189 (Array Int Int))) (= 5 (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)))) is different from false [2021-12-27 21:51:04,937 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_189 (Array Int Int))) (= 5 (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)))) is different from false [2021-12-27 21:51:04,946 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-27 21:51:04,946 INFO L387 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 [2021-12-27 21:51:04,952 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-27 21:51:04,952 INFO L387 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 [2021-12-27 21:51:04,955 INFO L387 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 [2021-12-27 21:51:04,991 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2021-12-27 21:51:04,991 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:51:04,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226067783] [2021-12-27 21:51:04,991 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-27 21:51:04,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23859696] [2021-12-27 21:51:04,991 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [23859696] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 21:51:04,992 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-27 21:51:04,992 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2021-12-27 21:51:04,992 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051430040] [2021-12-27 21:51:04,992 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-27 21:51:04,992 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-27 21:51:04,992 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:51:04,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-27 21:51:04,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=126, Unknown=2, NotChecked=46, Total=210 [2021-12-27 21:51:04,993 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) [2021-12-27 21:51:05,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:51:05,132 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2021-12-27 21:51:05,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-27 21:51:05,132 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 [2021-12-27 21:51:05,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:51:05,133 INFO L225 Difference]: With dead ends: 41 [2021-12-27 21:51:05,133 INFO L226 Difference]: Without dead ends: 34 [2021-12-27 21:51:05,133 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=238, Unknown=2, NotChecked=66, Total=380 [2021-12-27 21:51:05,134 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 16 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 38 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:51:05,134 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 56 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 121 Invalid, 0 Unknown, 38 Unchecked, 0.1s Time] [2021-12-27 21:51:05,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-12-27 21:51:05,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2021-12-27 21:51:05,137 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) [2021-12-27 21:51:05,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2021-12-27 21:51:05,138 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 21 [2021-12-27 21:51:05,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:51:05,138 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2021-12-27 21:51:05,138 INFO L471 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) [2021-12-27 21:51:05,138 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2021-12-27 21:51:05,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-27 21:51:05,139 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:51:05,139 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:51:05,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-27 21:51:05,355 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 21:51:05,355 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:51:05,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:51:05,356 INFO L85 PathProgramCache]: Analyzing trace with hash -2132829117, now seen corresponding path program 5 times [2021-12-27 21:51:05,356 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:51:05,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292639576] [2021-12-27 21:51:05,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:51:05,356 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:51:05,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:51:05,412 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:51:05,412 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:51:05,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292639576] [2021-12-27 21:51:05,413 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292639576] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-27 21:51:05,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639065681] [2021-12-27 21:51:05,413 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-27 21:51:05,413 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 21:51:05,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 21:51:05,414 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) [2021-12-27 21:51:05,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-27 21:51:05,471 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2021-12-27 21:51:05,471 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-27 21:51:05,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-27 21:51:05,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:51:05,546 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:51:05,546 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 21:51:05,590 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:51:05,590 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1639065681] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 21:51:05,590 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-27 21:51:05,590 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2021-12-27 21:51:05,590 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512304814] [2021-12-27 21:51:05,590 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-27 21:51:05,591 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-27 21:51:05,591 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:51:05,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-27 21:51:05,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2021-12-27 21:51:05,591 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) [2021-12-27 21:51:05,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:51:05,722 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2021-12-27 21:51:05,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-27 21:51:05,722 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 [2021-12-27 21:51:05,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:51:05,722 INFO L225 Difference]: With dead ends: 41 [2021-12-27 21:51:05,723 INFO L226 Difference]: Without dead ends: 37 [2021-12-27 21:51:05,723 INFO L932 BasicCegarLoop]: 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 [2021-12-27 21:51:05,723 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 35 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:51:05,724 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 28 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:51:05,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-12-27 21:51:05,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 25. [2021-12-27 21:51:05,726 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) [2021-12-27 21:51:05,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2021-12-27 21:51:05,727 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 23 [2021-12-27 21:51:05,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:51:05,727 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2021-12-27 21:51:05,727 INFO L471 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) [2021-12-27 21:51:05,727 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2021-12-27 21:51:05,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-27 21:51:05,728 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:51:05,728 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:51:05,746 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-27 21:51:05,945 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 21:51:05,945 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:51:05,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:51:05,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1038837147, now seen corresponding path program 6 times [2021-12-27 21:51:05,946 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:51:05,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966302241] [2021-12-27 21:51:05,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:51:05,946 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:51:05,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:51:06,018 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:51:06,019 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:51:06,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966302241] [2021-12-27 21:51:06,021 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966302241] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-27 21:51:06,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305646335] [2021-12-27 21:51:06,021 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-27 21:51:06,021 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 21:51:06,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 21:51:06,022 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) [2021-12-27 21:51:06,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-27 21:51:06,069 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2021-12-27 21:51:06,070 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-27 21:51:06,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-27 21:51:06,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:51:06,142 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:51:06,142 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 21:51:06,189 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:51:06,190 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [305646335] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 21:51:06,190 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-27 21:51:06,190 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2021-12-27 21:51:06,190 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504337616] [2021-12-27 21:51:06,190 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-27 21:51:06,191 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-27 21:51:06,191 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:51:06,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-27 21:51:06,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2021-12-27 21:51:06,192 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) [2021-12-27 21:51:06,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:51:06,261 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2021-12-27 21:51:06,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-27 21:51:06,262 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 [2021-12-27 21:51:06,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:51:06,263 INFO L225 Difference]: With dead ends: 45 [2021-12-27 21:51:06,263 INFO L226 Difference]: Without dead ends: 30 [2021-12-27 21:51:06,264 INFO L932 BasicCegarLoop]: 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 [2021-12-27 21:51:06,265 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 38 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-27 21:51:06,265 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 21 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-27 21:51:06,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-12-27 21:51:06,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2021-12-27 21:51:06,269 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) [2021-12-27 21:51:06,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2021-12-27 21:51:06,269 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 24 [2021-12-27 21:51:06,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:51:06,269 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2021-12-27 21:51:06,269 INFO L471 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) [2021-12-27 21:51:06,270 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2021-12-27 21:51:06,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-27 21:51:06,270 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:51:06,270 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:51:06,286 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-27 21:51:06,470 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-12-27 21:51:06,471 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:51:06,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:51:06,471 INFO L85 PathProgramCache]: Analyzing trace with hash -2121994781, now seen corresponding path program 7 times [2021-12-27 21:51:06,471 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:51:06,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57699540] [2021-12-27 21:51:06,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:51:06,471 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:51:06,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:51:06,845 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:51:06,845 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:51:06,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57699540] [2021-12-27 21:51:06,845 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57699540] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-27 21:51:06,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620441347] [2021-12-27 21:51:06,846 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-12-27 21:51:06,846 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 21:51:06,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 21:51:06,847 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) [2021-12-27 21:51:06,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-27 21:51:06,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:51:06,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 51 conjunts are in the unsatisfiable core [2021-12-27 21:51:06,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:51:06,907 INFO L387 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 [2021-12-27 21:51:06,910 INFO L387 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 [2021-12-27 21:51:06,919 INFO L387 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 [2021-12-27 21:51:06,935 INFO L387 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 [2021-12-27 21:51:06,959 INFO L387 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 [2021-12-27 21:51:07,064 INFO L387 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 [2021-12-27 21:51:07,154 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-27 21:51:07,155 INFO L387 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 63 treesize of output 41 [2021-12-27 21:51:07,282 INFO L353 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2021-12-27 21:51:07,282 INFO L387 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 [2021-12-27 21:51:07,469 INFO L353 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2021-12-27 21:51:07,469 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 79 treesize of output 35 [2021-12-27 21:51:07,498 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:51:07,498 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 21:51:14,368 WARN L838 $PredicateComparison]: unable to prove that (forall ((~N~0 Int)) (or (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0) (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|)) (.cse1 (select v_ArrVal_302 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_92| 4))))) (let ((.cse2 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse1))) |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 ((.cse0 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse1))) |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 5)) (not (= 5 .cse1)) (= (* 5 ~N~0) (+ .cse0 .cse2 .cse3 .cse1)) (not (= .cse2 5))))))))) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0)))) is different from false [2021-12-27 21:51:14,498 WARN L838 $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|)) (.cse1 (select v_ArrVal_302 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_92| 4))))) (let ((.cse2 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse1))) |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 ((.cse0 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse1))) |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 5)) (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0)) (not (= 5 .cse1)) (= (* 5 ~N~0) (+ .cse0 .cse2 .cse3 .cse1)) (not (= .cse2 5))))))))) is different from false [2021-12-27 21:51:14,714 WARN L838 $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|)) (.cse1 (select v_ArrVal_302 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_92| 4))))) (let ((.cse2 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse1))) |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 ((.cse0 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse1))) |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 5)) (not (= 5 .cse1)) (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (= (* 5 ~N~0) (+ .cse0 .cse2 .cse3 .cse1)) (not (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0)) (not (= .cse2 5))))))))) is different from false [2021-12-27 21:51:14,842 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2021-12-27 21:51:14,842 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [620441347] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 21:51:14,842 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-27 21:51:14,842 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 15] total 37 [2021-12-27 21:51:14,842 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408941446] [2021-12-27 21:51:14,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-27 21:51:14,843 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2021-12-27 21:51:14,843 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:51:14,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-12-27 21:51:14,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1006, Unknown=6, NotChecked=198, Total=1332 [2021-12-27 21:51:14,844 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 37 states, 37 states have (on average 1.5945945945945945) internal successors, (59), 37 states have internal predecessors, (59), 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) [2021-12-27 21:51:15,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:51:15,025 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2021-12-27 21:51:15,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-27 21:51:15,025 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.5945945945945945) internal successors, (59), 37 states have internal predecessors, (59), 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 [2021-12-27 21:51:15,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:51:15,026 INFO L225 Difference]: With dead ends: 45 [2021-12-27 21:51:15,026 INFO L226 Difference]: Without dead ends: 41 [2021-12-27 21:51:15,026 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 32 SyntacticMatches, 6 SemanticMatches, 38 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=156, Invalid=1182, Unknown=6, NotChecked=216, Total=1560 [2021-12-27 21:51:15,026 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 8 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 202 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:51:15,027 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 107 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 158 Invalid, 0 Unknown, 202 Unchecked, 0.1s Time] [2021-12-27 21:51:15,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2021-12-27 21:51:15,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2021-12-27 21:51:15,031 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) [2021-12-27 21:51:15,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2021-12-27 21:51:15,031 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 26 [2021-12-27 21:51:15,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:51:15,031 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2021-12-27 21:51:15,031 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.5945945945945945) internal successors, (59), 37 states have internal predecessors, (59), 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) [2021-12-27 21:51:15,031 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2021-12-27 21:51:15,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-27 21:51:15,032 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:51:15,032 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:51:15,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-27 21:51:15,232 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 21:51:15,232 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:51:15,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:51:15,232 INFO L85 PathProgramCache]: Analyzing trace with hash -2064736479, now seen corresponding path program 2 times [2021-12-27 21:51:15,233 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:51:15,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794346983] [2021-12-27 21:51:15,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:51:15,233 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:51:15,240 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-27 21:51:15,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2139846702] [2021-12-27 21:51:15,240 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-27 21:51:15,240 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 21:51:15,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 21:51:15,241 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) [2021-12-27 21:51:15,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-27 21:51:15,299 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-27 21:51:15,299 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-27 21:51:15,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 25 conjunts are in the unsatisfiable core [2021-12-27 21:51:15,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:51:15,311 INFO L387 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 [2021-12-27 21:51:15,346 INFO L387 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 [2021-12-27 21:51:15,390 INFO L387 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 [2021-12-27 21:51:15,421 INFO L387 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 [2021-12-27 21:51:15,449 INFO L387 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 [2021-12-27 21:51:15,463 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:51:15,464 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 21:51:15,502 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_351 (Array Int Int))) (= 5 (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)))) is different from false [2021-12-27 21:51:15,509 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_351 (Array Int Int))) (= 5 (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|)))) is different from false [2021-12-27 21:51:15,518 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_351 (Array Int Int))) (= 5 (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|)))) is different from false [2021-12-27 21:51:15,527 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-27 21:51:15,528 INFO L387 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 [2021-12-27 21:51:15,533 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-27 21:51:15,533 INFO L387 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 [2021-12-27 21:51:15,538 INFO L387 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 [2021-12-27 21:51:15,573 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2021-12-27 21:51:15,573 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:51:15,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794346983] [2021-12-27 21:51:15,573 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-27 21:51:15,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2139846702] [2021-12-27 21:51:15,573 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2139846702] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 21:51:15,573 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-27 21:51:15,573 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2021-12-27 21:51:15,574 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139985124] [2021-12-27 21:51:15,574 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-27 21:51:15,574 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-27 21:51:15,574 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:51:15,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-27 21:51:15,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=128, Unknown=3, NotChecked=72, Total=240 [2021-12-27 21:51:15,575 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) [2021-12-27 21:51:15,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:51:15,762 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2021-12-27 21:51:15,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-27 21:51:15,762 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 [2021-12-27 21:51:15,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:51:15,763 INFO L225 Difference]: With dead ends: 49 [2021-12-27 21:51:15,763 INFO L226 Difference]: Without dead ends: 42 [2021-12-27 21:51:15,763 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=276, Unknown=3, NotChecked=108, Total=462 [2021-12-27 21:51:15,764 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 17 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 78 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:51:15,764 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 62 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 191 Invalid, 0 Unknown, 78 Unchecked, 0.1s Time] [2021-12-27 21:51:15,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2021-12-27 21:51:15,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2021-12-27 21:51:15,769 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) [2021-12-27 21:51:15,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2021-12-27 21:51:15,769 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 26 [2021-12-27 21:51:15,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:51:15,769 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2021-12-27 21:51:15,770 INFO L471 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) [2021-12-27 21:51:15,770 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2021-12-27 21:51:15,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-27 21:51:15,770 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:51:15,770 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:51:15,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-27 21:51:15,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-12-27 21:51:15,983 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:51:15,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:51:15,984 INFO L85 PathProgramCache]: Analyzing trace with hash 640571873, now seen corresponding path program 8 times [2021-12-27 21:51:15,984 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:51:15,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632202756] [2021-12-27 21:51:15,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:51:15,984 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:51:15,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:51:16,072 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:51:16,073 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:51:16,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632202756] [2021-12-27 21:51:16,073 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632202756] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-27 21:51:16,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1908390734] [2021-12-27 21:51:16,073 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-27 21:51:16,073 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 21:51:16,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 21:51:16,075 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) [2021-12-27 21:51:16,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-27 21:51:16,130 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-27 21:51:16,130 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-27 21:51:16,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-27 21:51:16,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:51:16,227 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:51:16,227 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 21:51:16,287 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:51:16,287 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1908390734] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 21:51:16,287 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-27 21:51:16,287 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2021-12-27 21:51:16,288 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947789933] [2021-12-27 21:51:16,288 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-27 21:51:16,288 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-27 21:51:16,288 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:51:16,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-27 21:51:16,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2021-12-27 21:51:16,289 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) [2021-12-27 21:51:16,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:51:16,467 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2021-12-27 21:51:16,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-27 21:51:16,467 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 [2021-12-27 21:51:16,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:51:16,467 INFO L225 Difference]: With dead ends: 49 [2021-12-27 21:51:16,467 INFO L226 Difference]: Without dead ends: 45 [2021-12-27 21:51:16,468 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2021-12-27 21:51:16,468 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 41 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:51:16,468 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 31 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:51:16,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2021-12-27 21:51:16,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 30. [2021-12-27 21:51:16,472 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) [2021-12-27 21:51:16,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2021-12-27 21:51:16,472 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 28 [2021-12-27 21:51:16,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:51:16,473 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2021-12-27 21:51:16,473 INFO L471 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) [2021-12-27 21:51:16,473 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2021-12-27 21:51:16,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-27 21:51:16,473 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:51:16,473 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:51:16,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-12-27 21:51:16,687 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-12-27 21:51:16,687 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:51:16,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:51:16,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1478838205, now seen corresponding path program 9 times [2021-12-27 21:51:16,688 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:51:16,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065458137] [2021-12-27 21:51:16,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:51:16,688 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:51:16,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:51:16,763 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 15 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:51:16,764 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:51:16,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065458137] [2021-12-27 21:51:16,764 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065458137] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-27 21:51:16,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628234534] [2021-12-27 21:51:16,765 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-27 21:51:16,765 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 21:51:16,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 21:51:16,766 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) [2021-12-27 21:51:16,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-27 21:51:16,829 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-12-27 21:51:16,829 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-27 21:51:16,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-27 21:51:16,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:51:16,931 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:51:16,931 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 21:51:16,991 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:51:16,991 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1628234534] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 21:51:16,992 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-27 21:51:16,992 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2021-12-27 21:51:16,992 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346974553] [2021-12-27 21:51:16,992 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-27 21:51:16,992 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-27 21:51:16,992 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:51:16,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-27 21:51:16,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2021-12-27 21:51:16,993 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) [2021-12-27 21:51:17,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:51:17,100 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2021-12-27 21:51:17,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-27 21:51:17,101 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 [2021-12-27 21:51:17,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:51:17,102 INFO L225 Difference]: With dead ends: 53 [2021-12-27 21:51:17,102 INFO L226 Difference]: Without dead ends: 35 [2021-12-27 21:51:17,102 INFO L932 BasicCegarLoop]: 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 [2021-12-27 21:51:17,103 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 49 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:51:17,103 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 22 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:51:17,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-12-27 21:51:17,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2021-12-27 21:51:17,112 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) [2021-12-27 21:51:17,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2021-12-27 21:51:17,113 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 29 [2021-12-27 21:51:17,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:51:17,113 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2021-12-27 21:51:17,113 INFO L471 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) [2021-12-27 21:51:17,113 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2021-12-27 21:51:17,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-27 21:51:17,115 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:51:17,115 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:51:17,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-12-27 21:51:17,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-12-27 21:51:17,316 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:51:17,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:51:17,316 INFO L85 PathProgramCache]: Analyzing trace with hash -2018974843, now seen corresponding path program 10 times [2021-12-27 21:51:17,316 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:51:17,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977299616] [2021-12-27 21:51:17,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:51:17,316 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:51:17,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:51:17,760 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:51:17,761 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:51:17,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977299616] [2021-12-27 21:51:17,761 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977299616] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-27 21:51:17,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740084238] [2021-12-27 21:51:17,761 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-27 21:51:17,761 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 21:51:17,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 21:51:17,762 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) [2021-12-27 21:51:17,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-27 21:51:17,818 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-27 21:51:17,818 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-27 21:51:17,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 58 conjunts are in the unsatisfiable core [2021-12-27 21:51:17,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:51:17,835 INFO L387 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 [2021-12-27 21:51:17,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 21:51:17,863 INFO L387 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 [2021-12-27 21:51:17,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 21:51:17,903 INFO L387 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 [2021-12-27 21:51:17,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 21:51:17,941 INFO L387 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 [2021-12-27 21:51:17,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 21:51:17,985 INFO L387 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 [2021-12-27 21:51:18,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 21:51:18,144 INFO L387 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 [2021-12-27 21:51:18,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 21:51:18,263 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-27 21:51:18,264 INFO L387 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 [2021-12-27 21:51:18,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 21:51:18,406 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-27 21:51:18,406 INFO L387 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 [2021-12-27 21:51:18,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 21:51:18,545 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-27 21:51:18,545 INFO L387 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 [2021-12-27 21:51:18,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 21:51:18,681 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-27 21:51:18,681 INFO L387 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 60 treesize of output 32 [2021-12-27 21:51:18,715 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:51:18,715 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 21:51:31,015 WARN L838 $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 ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_487))) (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_487 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_153| 4))))) (let ((.cse3 (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_150| 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 .cse3 .cse1))) |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 ((.cse2 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse3 .cse0 .cse1))) |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 (not (= .cse0 5)) (not (= 5 .cse1)) (not (= .cse2 5)) (not (= .cse3 5)) (= (* 5 ~N~0) (+ .cse4 .cse3 .cse2 .cse0 .cse1)))))))))) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0)))) is different from false [2021-12-27 21:51:31,407 WARN L838 $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 ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_487))) (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_487 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_153| 4))))) (let ((.cse3 (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_150| 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 .cse3 .cse1))) |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 ((.cse2 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse3 .cse0 .cse1))) |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 (not (= .cse0 5)) (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0)) (not (= 5 .cse1)) (not (= .cse2 5)) (not (= .cse3 5)) (= (* 5 ~N~0) (+ .cse4 .cse3 .cse2 .cse0 .cse1)))))))))) is different from false [2021-12-27 21:51:32,192 WARN L838 $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 ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_487))) (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_487 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_153| 4))))) (let ((.cse3 (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_150| 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 .cse3 .cse1))) |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 ((.cse2 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse3 .cse0 .cse1))) |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 (not (= .cse0 5)) (not (= 5 .cse1)) (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (= .cse2 5)) (not (= .cse3 5)) (not (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0)) (= (* 5 ~N~0) (+ .cse4 .cse3 .cse2 .cse0 .cse1)))))))))) is different from false [2021-12-27 21:51:32,977 WARN L838 $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 ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_487))) (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_487 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_153| 4))))) (let ((.cse3 (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_150| 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 .cse3 .cse1))) |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 ((.cse2 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse3 .cse0 .cse1))) |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 (not (= .cse0 5)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 4) ~N~0) (not (= 5 .cse1)) (not (= .cse2 5)) (not (= .cse3 5)) (not (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0)) (= (* 5 ~N~0) (+ .cse4 .cse3 .cse2 .cse0 .cse1)))))))))) is different from false [2021-12-27 21:51:33,403 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2021-12-27 21:51:33,404 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1740084238] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 21:51:33,404 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-27 21:51:33,404 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18, 18] total 52 [2021-12-27 21:51:33,404 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416945986] [2021-12-27 21:51:33,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-27 21:51:33,404 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2021-12-27 21:51:33,405 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:51:33,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2021-12-27 21:51:33,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=2083, Unknown=8, NotChecked=380, Total=2652 [2021-12-27 21:51:33,406 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) [2021-12-27 21:51:33,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:51:33,839 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2021-12-27 21:51:33,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-27 21:51:33,840 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 [2021-12-27 21:51:33,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:51:33,840 INFO L225 Difference]: With dead ends: 52 [2021-12-27 21:51:33,840 INFO L226 Difference]: Without dead ends: 48 [2021-12-27 21:51:33,841 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 34 SyntacticMatches, 5 SemanticMatches, 53 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 815 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=223, Invalid=2335, Unknown=8, NotChecked=404, Total=2970 [2021-12-27 21:51:33,842 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 12 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 262 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:51:33,842 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 131 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 251 Invalid, 0 Unknown, 262 Unchecked, 0.1s Time] [2021-12-27 21:51:33,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2021-12-27 21:51:33,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2021-12-27 21:51:33,847 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) [2021-12-27 21:51:33,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2021-12-27 21:51:33,847 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 31 [2021-12-27 21:51:33,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:51:33,847 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2021-12-27 21:51:33,848 INFO L471 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) [2021-12-27 21:51:33,848 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2021-12-27 21:51:33,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-27 21:51:33,848 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:51:33,848 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:51:33,866 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2021-12-27 21:51:34,063 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-12-27 21:51:34,063 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:51:34,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:51:34,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1961716541, now seen corresponding path program 3 times [2021-12-27 21:51:34,064 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:51:34,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467258504] [2021-12-27 21:51:34,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:51:34,064 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:51:34,073 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-27 21:51:34,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [528022586] [2021-12-27 21:51:34,073 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-27 21:51:34,074 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 21:51:34,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 21:51:34,074 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) [2021-12-27 21:51:34,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-27 21:51:34,141 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-12-27 21:51:34,141 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-27 21:51:34,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-27 21:51:34,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:51:34,151 INFO L387 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 [2021-12-27 21:51:34,169 INFO L387 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 [2021-12-27 21:51:34,238 INFO L387 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 [2021-12-27 21:51:34,266 INFO L387 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 [2021-12-27 21:51:34,305 INFO L387 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 [2021-12-27 21:51:34,332 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-27 21:51:34,333 INFO L387 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 [2021-12-27 21:51:34,378 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-27 21:51:34,378 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 21:51:34,431 WARN L838 $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) (= 5 (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|))) (not (< |ULTIMATE.start_main_~i~0#1| c_~N~0)))) is different from false [2021-12-27 21:51:34,567 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-27 21:51:34,567 INFO L387 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 [2021-12-27 21:51:34,572 INFO L353 Elim1Store]: treesize reduction 12, result has 25.0 percent of original size [2021-12-27 21:51:34,572 INFO L387 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 [2021-12-27 21:51:34,591 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 16 trivial. 13 not checked. [2021-12-27 21:51:34,592 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:51:34,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467258504] [2021-12-27 21:51:34,592 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-27 21:51:34,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528022586] [2021-12-27 21:51:34,592 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528022586] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 21:51:34,592 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-27 21:51:34,592 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-12-27 21:51:34,592 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691594161] [2021-12-27 21:51:34,592 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-27 21:51:34,592 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-27 21:51:34,592 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:51:34,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-27 21:51:34,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=129, Unknown=6, NotChecked=24, Total=210 [2021-12-27 21:51:34,593 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) [2021-12-27 21:51:38,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:51:38,679 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2021-12-27 21:51:38,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-27 21:51:38,679 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 [2021-12-27 21:51:38,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:51:38,679 INFO L225 Difference]: With dead ends: 55 [2021-12-27 21:51:38,679 INFO L226 Difference]: Without dead ends: 51 [2021-12-27 21:51:38,680 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 2 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=73, Invalid=165, Unknown=6, NotChecked=28, Total=272 [2021-12-27 21:51:38,680 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 4 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 56 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-27 21:51:38,680 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 33 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 56 Unchecked, 0.0s Time] [2021-12-27 21:51:38,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-12-27 21:51:38,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2021-12-27 21:51:38,686 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) [2021-12-27 21:51:38,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2021-12-27 21:51:38,686 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 31 [2021-12-27 21:51:38,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:51:38,687 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2021-12-27 21:51:38,687 INFO L471 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) [2021-12-27 21:51:38,687 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2021-12-27 21:51:38,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-27 21:51:38,687 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:51:38,687 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:51:38,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2021-12-27 21:51:38,903 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 21:51:38,903 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:51:38,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:51:38,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1399241145, now seen corresponding path program 11 times [2021-12-27 21:51:38,904 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:51:38,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580098025] [2021-12-27 21:51:38,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:51:38,904 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:51:38,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:51:38,995 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 9 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:51:38,996 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:51:38,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580098025] [2021-12-27 21:51:38,996 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580098025] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-27 21:51:38,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [279083304] [2021-12-27 21:51:38,996 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-27 21:51:38,996 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 21:51:38,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 21:51:38,998 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) [2021-12-27 21:51:38,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-12-27 21:51:39,073 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2021-12-27 21:51:39,074 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-27 21:51:39,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-27 21:51:39,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:51:39,186 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:51:39,186 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 21:51:39,248 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:51:39,248 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [279083304] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 21:51:39,248 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-27 21:51:39,248 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2021-12-27 21:51:39,249 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331248642] [2021-12-27 21:51:39,249 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-27 21:51:39,249 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-27 21:51:39,249 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:51:39,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-27 21:51:39,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2021-12-27 21:51:39,250 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) [2021-12-27 21:51:39,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:51:39,487 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2021-12-27 21:51:39,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-27 21:51:39,487 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 [2021-12-27 21:51:39,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:51:39,488 INFO L225 Difference]: With dead ends: 69 [2021-12-27 21:51:39,488 INFO L226 Difference]: Without dead ends: 65 [2021-12-27 21:51:39,488 INFO L932 BasicCegarLoop]: 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 [2021-12-27 21:51:39,488 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 46 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-27 21:51:39,489 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 28 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-27 21:51:39,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-12-27 21:51:39,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 40. [2021-12-27 21:51:39,493 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) [2021-12-27 21:51:39,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2021-12-27 21:51:39,494 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 33 [2021-12-27 21:51:39,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:51:39,494 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2021-12-27 21:51:39,494 INFO L471 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) [2021-12-27 21:51:39,494 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2021-12-27 21:51:39,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-27 21:51:39,494 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:51:39,494 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:51:39,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-12-27 21:51:39,703 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-12-27 21:51:39,703 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:51:39,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:51:39,704 INFO L85 PathProgramCache]: Analyzing trace with hash 981485409, now seen corresponding path program 12 times [2021-12-27 21:51:39,704 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:51:39,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442382698] [2021-12-27 21:51:39,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:51:39,704 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:51:39,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:51:39,794 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 25 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:51:39,794 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:51:39,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442382698] [2021-12-27 21:51:39,794 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442382698] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-27 21:51:39,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1631649663] [2021-12-27 21:51:39,794 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-27 21:51:39,794 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 21:51:39,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 21:51:39,795 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) [2021-12-27 21:51:39,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-12-27 21:51:39,865 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2021-12-27 21:51:39,866 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-27 21:51:39,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-27 21:51:39,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:51:39,998 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 35 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:51:39,998 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 21:51:40,071 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 35 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:51:40,072 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1631649663] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 21:51:40,072 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-27 21:51:40,072 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2021-12-27 21:51:40,072 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681010343] [2021-12-27 21:51:40,072 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-27 21:51:40,072 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-27 21:51:40,072 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:51:40,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-27 21:51:40,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2021-12-27 21:51:40,073 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) [2021-12-27 21:51:40,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:51:40,192 INFO L93 Difference]: Finished difference Result 78 states and 90 transitions. [2021-12-27 21:51:40,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-27 21:51:40,193 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 [2021-12-27 21:51:40,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:51:40,193 INFO L225 Difference]: With dead ends: 78 [2021-12-27 21:51:40,193 INFO L226 Difference]: Without dead ends: 50 [2021-12-27 21:51:40,194 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=161, Invalid=439, Unknown=0, NotChecked=0, Total=600 [2021-12-27 21:51:40,194 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 61 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:51:40,194 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 34 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:51:40,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-12-27 21:51:40,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2021-12-27 21:51:40,199 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) [2021-12-27 21:51:40,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2021-12-27 21:51:40,199 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 34 [2021-12-27 21:51:40,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:51:40,200 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2021-12-27 21:51:40,200 INFO L471 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) [2021-12-27 21:51:40,200 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2021-12-27 21:51:40,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-27 21:51:40,200 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:51:40,200 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:51:40,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-12-27 21:51:40,411 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-12-27 21:51:40,411 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:51:40,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:51:40,412 INFO L85 PathProgramCache]: Analyzing trace with hash -596322977, now seen corresponding path program 13 times [2021-12-27 21:51:40,412 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:51:40,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065833414] [2021-12-27 21:51:40,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:51:40,412 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:51:40,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:51:40,985 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:51:40,985 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:51:40,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065833414] [2021-12-27 21:51:40,986 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065833414] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-27 21:51:40,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537559177] [2021-12-27 21:51:40,986 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-12-27 21:51:40,986 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 21:51:40,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 21:51:40,987 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) [2021-12-27 21:51:40,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-12-27 21:51:41,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:51:41,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 73 conjunts are in the unsatisfiable core [2021-12-27 21:51:41,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:51:41,073 INFO L387 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 [2021-12-27 21:51:41,076 INFO L387 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 [2021-12-27 21:51:41,083 INFO L387 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 [2021-12-27 21:51:41,100 INFO L387 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 [2021-12-27 21:51:41,127 INFO L387 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 [2021-12-27 21:51:41,144 INFO L387 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 [2021-12-27 21:51:41,166 INFO L387 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 [2021-12-27 21:51:41,327 INFO L387 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 [2021-12-27 21:51:41,434 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-27 21:51:41,434 INFO L387 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 59 treesize of output 41 [2021-12-27 21:51:41,568 INFO L353 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2021-12-27 21:51:41,569 INFO L387 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 [2021-12-27 21:51:41,729 INFO L353 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2021-12-27 21:51:41,730 INFO L387 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 91 treesize of output 60 [2021-12-27 21:51:41,869 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-27 21:51:41,869 INFO L387 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 [2021-12-27 21:51:42,038 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-27 21:51:42,038 INFO L387 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 77 treesize of output 33 [2021-12-27 21:51:42,073 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:51:42,073 INFO L328 TraceCheckSpWp]: Computing backward predicates...