./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext3/getNumbers4-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 5fbdf5bf 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/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext3/getNumbers4-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 440325a953e10d2173456ab8f8c8fc1313a6b958 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref) --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5fbdf5b [2021-08-30 19:12:34,999 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-30 19:12:35,002 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-30 19:12:35,040 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-30 19:12:35,041 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-30 19:12:35,045 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-30 19:12:35,046 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-30 19:12:35,052 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-30 19:12:35,054 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-30 19:12:35,058 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-30 19:12:35,060 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-30 19:12:35,064 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-30 19:12:35,064 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-30 19:12:35,067 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-30 19:12:35,069 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-30 19:12:35,072 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-30 19:12:35,073 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-30 19:12:35,074 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-30 19:12:35,076 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-30 19:12:35,083 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-30 19:12:35,085 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-30 19:12:35,086 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-30 19:12:35,089 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-30 19:12:35,089 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-30 19:12:35,096 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-30 19:12:35,096 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-30 19:12:35,097 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-30 19:12:35,098 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-30 19:12:35,099 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-30 19:12:35,100 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-30 19:12:35,100 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-30 19:12:35,101 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-30 19:12:35,103 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-30 19:12:35,103 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-30 19:12:35,104 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-30 19:12:35,105 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-30 19:12:35,105 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-30 19:12:35,106 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-30 19:12:35,106 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-30 19:12:35,107 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-30 19:12:35,108 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-30 19:12:35,109 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-08-30 19:12:35,156 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-30 19:12:35,157 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-30 19:12:35,158 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-30 19:12:35,158 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-30 19:12:35,160 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-30 19:12:35,160 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-30 19:12:35,161 INFO L138 SettingsManager]: * Use SBE=true [2021-08-30 19:12:35,161 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-30 19:12:35,161 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-30 19:12:35,161 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-30 19:12:35,162 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-30 19:12:35,162 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-30 19:12:35,163 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-30 19:12:35,163 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-08-30 19:12:35,163 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-08-30 19:12:35,163 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-08-30 19:12:35,163 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-30 19:12:35,164 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-08-30 19:12:35,164 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-30 19:12:35,164 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-30 19:12:35,164 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-30 19:12:35,164 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-30 19:12:35,164 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-30 19:12:35,165 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-30 19:12:35,165 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-30 19:12:35,165 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-30 19:12:35,165 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-30 19:12:35,165 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-30 19:12:35,166 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-30 19:12:35,166 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 440325a953e10d2173456ab8f8c8fc1313a6b958 [2021-08-30 19:12:35,445 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-30 19:12:35,463 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-30 19:12:35,465 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-30 19:12:35,466 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-30 19:12:35,467 INFO L275 PluginConnector]: CDTParser initialized [2021-08-30 19:12:35,468 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext3/getNumbers4-2.c [2021-08-30 19:12:35,529 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f90779844/7a08ca2cdab9499983405be6c3cf068b/FLAG62b33b2d9 [2021-08-30 19:12:35,915 INFO L306 CDTParser]: Found 1 translation units. [2021-08-30 19:12:35,916 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext3/getNumbers4-2.c [2021-08-30 19:12:35,922 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f90779844/7a08ca2cdab9499983405be6c3cf068b/FLAG62b33b2d9 [2021-08-30 19:12:35,938 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f90779844/7a08ca2cdab9499983405be6c3cf068b [2021-08-30 19:12:35,943 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-30 19:12:35,945 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-30 19:12:35,948 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-30 19:12:35,948 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-30 19:12:35,951 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-30 19:12:35,952 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 07:12:35" (1/1) ... [2021-08-30 19:12:35,953 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ec7c5df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 07:12:35, skipping insertion in model container [2021-08-30 19:12:35,953 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 07:12:35" (1/1) ... [2021-08-30 19:12:35,959 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-30 19:12:35,977 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-30 19:12:36,129 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-30 19:12:36,144 INFO L203 MainTranslator]: Completed pre-run [2021-08-30 19:12:36,178 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-30 19:12:36,191 INFO L208 MainTranslator]: Completed translation [2021-08-30 19:12:36,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 07:12:36 WrapperNode [2021-08-30 19:12:36,193 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-30 19:12:36,194 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-30 19:12:36,194 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-30 19:12:36,195 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-30 19:12:36,228 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 07:12:36" (1/1) ... [2021-08-30 19:12:36,239 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 07:12:36" (1/1) ... [2021-08-30 19:12:36,262 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 07:12:36" (1/1) ... [2021-08-30 19:12:36,263 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 07:12:36" (1/1) ... [2021-08-30 19:12:36,271 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 07:12:36" (1/1) ... [2021-08-30 19:12:36,275 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 07:12:36" (1/1) ... [2021-08-30 19:12:36,276 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 07:12:36" (1/1) ... [2021-08-30 19:12:36,278 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-30 19:12:36,279 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-30 19:12:36,280 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-30 19:12:36,280 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-30 19:12:36,280 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 07:12:36" (1/1) ... [2021-08-30 19:12:36,286 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-30 19:12:36,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 19:12:36,305 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-08-30 19:12:36,333 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-08-30 19:12:36,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-08-30 19:12:36,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-30 19:12:36,352 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers [2021-08-30 19:12:36,352 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers2 [2021-08-30 19:12:36,352 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers3 [2021-08-30 19:12:36,352 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers4 [2021-08-30 19:12:36,352 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-08-30 19:12:36,353 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2021-08-30 19:12:36,353 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers [2021-08-30 19:12:36,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-30 19:12:36,353 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers2 [2021-08-30 19:12:36,354 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-30 19:12:36,354 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers3 [2021-08-30 19:12:36,354 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-30 19:12:36,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-30 19:12:36,355 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers4 [2021-08-30 19:12:36,355 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-08-30 19:12:36,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-08-30 19:12:36,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-30 19:12:36,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-30 19:12:36,608 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-30 19:12:36,608 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2021-08-30 19:12:36,610 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 07:12:36 BoogieIcfgContainer [2021-08-30 19:12:36,610 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-30 19:12:36,612 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-30 19:12:36,612 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-30 19:12:36,615 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-30 19:12:36,615 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 07:12:35" (1/3) ... [2021-08-30 19:12:36,616 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@745b2ed7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 07:12:36, skipping insertion in model container [2021-08-30 19:12:36,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 07:12:36" (2/3) ... [2021-08-30 19:12:36,617 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@745b2ed7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 07:12:36, skipping insertion in model container [2021-08-30 19:12:36,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 07:12:36" (3/3) ... [2021-08-30 19:12:36,618 INFO L111 eAbstractionObserver]: Analyzing ICFG getNumbers4-2.c [2021-08-30 19:12:36,623 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-30 19:12:36,623 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 17 error locations. [2021-08-30 19:12:36,660 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-30 19:12:36,667 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=false, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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-08-30 19:12:36,667 INFO L340 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2021-08-30 19:12:36,681 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 40 states have (on average 1.675) internal successors, (67), 57 states have internal predecessors, (67), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-08-30 19:12:36,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-30 19:12:36,689 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 19:12:36,689 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 19:12:36,690 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting getNumbersErr0REQUIRES_VIOLATION === [getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION (and 13 more)] === [2021-08-30 19:12:36,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 19:12:36,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1833468390, now seen corresponding path program 1 times [2021-08-30 19:12:36,720 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 19:12:36,721 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272954720] [2021-08-30 19:12:36,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 19:12:36,722 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 19:12:36,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:12:37,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 19:12:37,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:12:37,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 19:12:37,060 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 19:12:37,060 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272954720] [2021-08-30 19:12:37,061 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272954720] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 19:12:37,062 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-30 19:12:37,062 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-30 19:12:37,063 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161786199] [2021-08-30 19:12:37,068 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-30 19:12:37,068 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 19:12:37,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-30 19:12:37,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-30 19:12:37,096 INFO L87 Difference]: Start difference. First operand has 70 states, 40 states have (on average 1.675) internal successors, (67), 57 states have internal predecessors, (67), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 4 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-30 19:12:37,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 19:12:37,364 INFO L93 Difference]: Finished difference Result 87 states and 93 transitions. [2021-08-30 19:12:37,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-30 19:12:37,367 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2021-08-30 19:12:37,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 19:12:37,373 INFO L225 Difference]: With dead ends: 87 [2021-08-30 19:12:37,374 INFO L226 Difference]: Without dead ends: 84 [2021-08-30 19:12:37,375 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 69.19ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-30 19:12:37,378 INFO L928 BasicCegarLoop]: 10 mSDtfsCounter, 61 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 163.48ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.11ms SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 195.37ms IncrementalHoareTripleChecker+Time [2021-08-30 19:12:37,379 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 11 Invalid, 172 Unknown, 0 Unchecked, 4.11ms Time], IncrementalHoareTripleChecker [13 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 195.37ms Time] [2021-08-30 19:12:37,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-08-30 19:12:37,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 66. [2021-08-30 19:12:37,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 39 states have (on average 1.5128205128205128) internal successors, (59), 54 states have internal predecessors, (59), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-30 19:12:37,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2021-08-30 19:12:37,412 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 12 [2021-08-30 19:12:37,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 19:12:37,413 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2021-08-30 19:12:37,413 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-30 19:12:37,413 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2021-08-30 19:12:37,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-30 19:12:37,414 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 19:12:37,414 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 19:12:37,414 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-30 19:12:37,415 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting getNumbersErr1REQUIRES_VIOLATION === [getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION (and 13 more)] === [2021-08-30 19:12:37,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 19:12:37,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1833468391, now seen corresponding path program 1 times [2021-08-30 19:12:37,416 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 19:12:37,416 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793009401] [2021-08-30 19:12:37,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 19:12:37,417 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 19:12:37,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:12:37,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 19:12:37,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:12:37,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 19:12:37,569 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 19:12:37,569 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793009401] [2021-08-30 19:12:37,569 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793009401] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 19:12:37,569 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-30 19:12:37,570 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-30 19:12:37,570 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130092440] [2021-08-30 19:12:37,571 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-30 19:12:37,571 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 19:12:37,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-30 19:12:37,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-30 19:12:37,572 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-30 19:12:37,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 19:12:37,847 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2021-08-30 19:12:37,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-30 19:12:37,848 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2021-08-30 19:12:37,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 19:12:37,849 INFO L225 Difference]: With dead ends: 69 [2021-08-30 19:12:37,849 INFO L226 Difference]: Without dead ends: 69 [2021-08-30 19:12:37,850 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 109.01ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-08-30 19:12:37,851 INFO L928 BasicCegarLoop]: 7 mSDtfsCounter, 63 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 120.46ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.40ms SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 184.71ms IncrementalHoareTripleChecker+Time [2021-08-30 19:12:37,852 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 8 Invalid, 204 Unknown, 0 Unchecked, 5.40ms Time], IncrementalHoareTripleChecker [10 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 184.71ms Time] [2021-08-30 19:12:37,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2021-08-30 19:12:37,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2021-08-30 19:12:37,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 41 states have (on average 1.4878048780487805) internal successors, (61), 56 states have internal predecessors, (61), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-30 19:12:37,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2021-08-30 19:12:37,863 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 12 [2021-08-30 19:12:37,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 19:12:37,864 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2021-08-30 19:12:37,864 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-30 19:12:37,865 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2021-08-30 19:12:37,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-30 19:12:37,867 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 19:12:37,867 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 19:12:37,868 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-30 19:12:37,868 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting getNumbersErr1REQUIRES_VIOLATION === [getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION (and 13 more)] === [2021-08-30 19:12:37,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 19:12:37,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1757784526, now seen corresponding path program 1 times [2021-08-30 19:12:37,869 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 19:12:37,870 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546356221] [2021-08-30 19:12:37,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 19:12:37,870 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 19:12:37,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:12:38,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 19:12:38,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:12:38,086 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 19:12:38,086 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 19:12:38,087 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546356221] [2021-08-30 19:12:38,087 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546356221] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 19:12:38,087 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2035908765] [2021-08-30 19:12:38,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 19:12:38,088 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 19:12:38,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 19:12:38,097 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-08-30 19:12:38,106 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-08-30 19:12:38,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:12:38,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 17 conjunts are in the unsatisfiable core [2021-08-30 19:12:38,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 19:12:38,301 INFO L354 Elim1Store]: treesize reduction 89, result has 18.3 percent of original size [2021-08-30 19:12:38,306 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 47 treesize of output 56 [2021-08-30 19:12:38,335 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-08-30 19:12:38,336 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 186 treesize of output 182 [2021-08-30 19:12:39,097 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 19:12:39,098 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 19:12:39,316 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 19:12:39,317 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2035908765] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 19:12:39,317 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 19:12:39,317 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2021-08-30 19:12:39,325 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674465774] [2021-08-30 19:12:39,327 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-30 19:12:39,327 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 19:12:39,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-30 19:12:39,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2021-08-30 19:12:39,329 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 4 states have call successors, (17), 5 states have call predecessors, (17), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-30 19:12:39,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 19:12:39,500 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2021-08-30 19:12:39,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-30 19:12:39,501 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 4 states have call successors, (17), 5 states have call predecessors, (17), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 15 [2021-08-30 19:12:39,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 19:12:39,502 INFO L225 Difference]: With dead ends: 74 [2021-08-30 19:12:39,502 INFO L226 Difference]: Without dead ends: 74 [2021-08-30 19:12:39,502 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 132.34ms TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2021-08-30 19:12:39,503 INFO L928 BasicCegarLoop]: 11 mSDtfsCounter, 0 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 117.59ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.59ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 107 IncrementalHoareTripleChecker+Unchecked, 145.34ms IncrementalHoareTripleChecker+Time [2021-08-30 19:12:39,504 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 15 Invalid, 373 Unknown, 0 Unchecked, 6.59ms Time], IncrementalHoareTripleChecker [0 Valid, 266 Invalid, 0 Unknown, 107 Unchecked, 145.34ms Time] [2021-08-30 19:12:39,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2021-08-30 19:12:39,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2021-08-30 19:12:39,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 62 states have internal predecessors, (69), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-30 19:12:39,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2021-08-30 19:12:39,510 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 15 [2021-08-30 19:12:39,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 19:12:39,511 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2021-08-30 19:12:39,511 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 4 states have call successors, (17), 5 states have call predecessors, (17), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-30 19:12:39,511 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2021-08-30 19:12:39,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-30 19:12:39,512 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 19:12:39,512 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 19:12:39,542 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-08-30 19:12:39,738 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-08-30 19:12:39,738 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting getNumbers2Err0REQUIRES_VIOLATION === [getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION (and 13 more)] === [2021-08-30 19:12:39,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 19:12:39,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1275227987, now seen corresponding path program 1 times [2021-08-30 19:12:39,739 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 19:12:39,739 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261510050] [2021-08-30 19:12:39,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 19:12:39,739 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 19:12:39,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:12:39,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 19:12:39,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:12:39,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-08-30 19:12:39,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:12:39,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 19:12:39,811 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 19:12:39,811 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261510050] [2021-08-30 19:12:39,811 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261510050] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 19:12:39,811 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641203205] [2021-08-30 19:12:39,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 19:12:39,812 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 19:12:39,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 19:12:39,813 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-08-30 19:12:39,839 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-08-30 19:12:39,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:12:39,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-30 19:12:39,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 19:12:39,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 19:12:39,909 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 19:12:39,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 19:12:39,964 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641203205] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 19:12:39,964 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 19:12:39,964 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 8 [2021-08-30 19:12:39,964 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098413685] [2021-08-30 19:12:39,965 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-30 19:12:39,965 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 19:12:39,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-30 19:12:39,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-08-30 19:12:39,966 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-30 19:12:40,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 19:12:40,169 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2021-08-30 19:12:40,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-30 19:12:40,171 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2021-08-30 19:12:40,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 19:12:40,174 INFO L225 Difference]: With dead ends: 76 [2021-08-30 19:12:40,175 INFO L226 Difference]: Without dead ends: 76 [2021-08-30 19:12:40,175 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 59.92ms TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-08-30 19:12:40,177 INFO L928 BasicCegarLoop]: 11 mSDtfsCounter, 15 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 113.62ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.75ms SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 164.38ms IncrementalHoareTripleChecker+Time [2021-08-30 19:12:40,178 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 45 Invalid, 312 Unknown, 0 Unchecked, 2.75ms Time], IncrementalHoareTripleChecker [17 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 164.38ms Time] [2021-08-30 19:12:40,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-08-30 19:12:40,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2021-08-30 19:12:40,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 64 states have internal predecessors, (69), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-30 19:12:40,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2021-08-30 19:12:40,192 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 20 [2021-08-30 19:12:40,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 19:12:40,193 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2021-08-30 19:12:40,193 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-30 19:12:40,193 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2021-08-30 19:12:40,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-30 19:12:40,194 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 19:12:40,194 INFO L513 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 19:12:40,216 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-08-30 19:12:40,408 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-08-30 19:12:40,409 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting getNumbersErr1REQUIRES_VIOLATION === [getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION (and 13 more)] === [2021-08-30 19:12:40,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 19:12:40,410 INFO L82 PathProgramCache]: Analyzing trace with hash -355499218, now seen corresponding path program 2 times [2021-08-30 19:12:40,410 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 19:12:40,410 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145242826] [2021-08-30 19:12:40,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 19:12:40,411 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 19:12:40,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:12:40,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 19:12:40,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:12:40,568 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 19:12:40,572 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 19:12:40,572 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145242826] [2021-08-30 19:12:40,572 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145242826] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 19:12:40,572 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1560712060] [2021-08-30 19:12:40,572 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-30 19:12:40,573 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 19:12:40,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 19:12:40,581 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-08-30 19:12:40,582 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-08-30 19:12:40,633 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-30 19:12:40,633 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-30 19:12:40,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 18 conjunts are in the unsatisfiable core [2021-08-30 19:12:40,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 19:12:40,685 INFO L354 Elim1Store]: treesize reduction 89, result has 18.3 percent of original size [2021-08-30 19:12:40,685 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 47 treesize of output 56 [2021-08-30 19:12:40,692 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-08-30 19:12:40,693 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 158 treesize of output 150 [2021-08-30 19:12:41,530 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 19:12:41,530 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-08-30 19:12:41,530 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1560712060] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 19:12:41,531 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-30 19:12:41,531 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 13 [2021-08-30 19:12:41,531 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440389976] [2021-08-30 19:12:41,531 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-30 19:12:41,532 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 19:12:41,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-30 19:12:41,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2021-08-30 19:12:41,532 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-30 19:12:41,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 19:12:41,574 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2021-08-30 19:12:41,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-30 19:12:41,574 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2021-08-30 19:12:41,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 19:12:41,575 INFO L225 Difference]: With dead ends: 75 [2021-08-30 19:12:41,575 INFO L226 Difference]: Without dead ends: 75 [2021-08-30 19:12:41,576 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 167.06ms TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2021-08-30 19:12:41,576 INFO L928 BasicCegarLoop]: 11 mSDtfsCounter, 0 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.62ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.53ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 68 IncrementalHoareTripleChecker+Unchecked, 36.18ms IncrementalHoareTripleChecker+Time [2021-08-30 19:12:41,576 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 12 Invalid, 118 Unknown, 0 Unchecked, 0.53ms Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 68 Unchecked, 36.18ms Time] [2021-08-30 19:12:41,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-08-30 19:12:41,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2021-08-30 19:12:41,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 63 states have internal predecessors, (68), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-30 19:12:41,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2021-08-30 19:12:41,582 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 21 [2021-08-30 19:12:41,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 19:12:41,582 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2021-08-30 19:12:41,582 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-30 19:12:41,582 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2021-08-30 19:12:41,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-08-30 19:12:41,583 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 19:12:41,583 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 19:12:41,611 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-08-30 19:12:41,796 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-08-30 19:12:41,797 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting getNumbers2Err0REQUIRES_VIOLATION === [getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION (and 13 more)] === [2021-08-30 19:12:41,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 19:12:41,797 INFO L82 PathProgramCache]: Analyzing trace with hash 502160116, now seen corresponding path program 2 times [2021-08-30 19:12:41,797 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 19:12:41,798 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513862189] [2021-08-30 19:12:41,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 19:12:41,798 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 19:12:41,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:12:41,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 19:12:41,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:12:41,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-08-30 19:12:41,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:12:41,908 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-08-30 19:12:41,909 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 19:12:41,909 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513862189] [2021-08-30 19:12:41,909 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513862189] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 19:12:41,910 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-30 19:12:41,910 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-30 19:12:41,910 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925270279] [2021-08-30 19:12:41,910 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-30 19:12:41,911 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 19:12:41,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-30 19:12:41,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-08-30 19:12:41,911 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-30 19:12:42,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 19:12:42,188 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2021-08-30 19:12:42,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-30 19:12:42,189 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2021-08-30 19:12:42,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 19:12:42,189 INFO L225 Difference]: With dead ends: 74 [2021-08-30 19:12:42,190 INFO L226 Difference]: Without dead ends: 74 [2021-08-30 19:12:42,190 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 71.55ms TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-08-30 19:12:42,190 INFO L928 BasicCegarLoop]: 9 mSDtfsCounter, 39 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 185.30ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.04ms SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 227.47ms IncrementalHoareTripleChecker+Time [2021-08-30 19:12:42,191 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 20 Invalid, 402 Unknown, 0 Unchecked, 3.04ms Time], IncrementalHoareTripleChecker [15 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 227.47ms Time] [2021-08-30 19:12:42,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2021-08-30 19:12:42,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2021-08-30 19:12:42,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 49 states have (on average 1.3673469387755102) internal successors, (67), 62 states have internal predecessors, (67), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-30 19:12:42,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2021-08-30 19:12:42,194 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 29 [2021-08-30 19:12:42,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 19:12:42,195 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2021-08-30 19:12:42,195 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-30 19:12:42,195 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2021-08-30 19:12:42,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-08-30 19:12:42,196 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 19:12:42,196 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 19:12:42,196 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-30 19:12:42,197 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting getNumbers2Err1REQUIRES_VIOLATION === [getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION (and 13 more)] === [2021-08-30 19:12:42,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 19:12:42,197 INFO L82 PathProgramCache]: Analyzing trace with hash 502160117, now seen corresponding path program 1 times [2021-08-30 19:12:42,197 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 19:12:42,197 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321886475] [2021-08-30 19:12:42,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 19:12:42,198 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 19:12:42,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:12:42,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 19:12:42,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:12:42,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-08-30 19:12:42,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:12:42,373 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 19:12:42,374 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 19:12:42,374 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321886475] [2021-08-30 19:12:42,374 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321886475] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 19:12:42,374 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1661552586] [2021-08-30 19:12:42,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 19:12:42,374 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 19:12:42,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 19:12:42,376 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-08-30 19:12:42,392 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-08-30 19:12:42,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:12:42,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-30 19:12:42,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 19:12:42,484 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 19:12:42,484 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 19:12:42,604 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 19:12:42,604 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1661552586] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 19:12:42,607 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 19:12:42,607 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 17 [2021-08-30 19:12:42,607 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517306677] [2021-08-30 19:12:42,609 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-08-30 19:12:42,610 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 19:12:42,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-08-30 19:12:42,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2021-08-30 19:12:42,611 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 14 states have internal predecessors, (41), 2 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2021-08-30 19:12:43,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 19:12:43,007 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2021-08-30 19:12:43,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-30 19:12:43,008 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 14 states have internal predecessors, (41), 2 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2021-08-30 19:12:43,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 19:12:43,009 INFO L225 Difference]: With dead ends: 92 [2021-08-30 19:12:43,009 INFO L226 Difference]: Without dead ends: 92 [2021-08-30 19:12:43,009 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 274.48ms TimeCoverageRelationStatistics Valid=238, Invalid=574, Unknown=0, NotChecked=0, Total=812 [2021-08-30 19:12:43,010 INFO L928 BasicCegarLoop]: 7 mSDtfsCounter, 108 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 174.49ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.59ms SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 220.61ms IncrementalHoareTripleChecker+Time [2021-08-30 19:12:43,010 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 29 Invalid, 425 Unknown, 0 Unchecked, 4.59ms Time], IncrementalHoareTripleChecker [32 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 220.61ms Time] [2021-08-30 19:12:43,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-08-30 19:12:43,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2021-08-30 19:12:43,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 67 states have (on average 1.2686567164179106) internal successors, (85), 80 states have internal predecessors, (85), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-30 19:12:43,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2021-08-30 19:12:43,016 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 29 [2021-08-30 19:12:43,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 19:12:43,017 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2021-08-30 19:12:43,017 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 14 states have internal predecessors, (41), 2 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2021-08-30 19:12:43,017 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2021-08-30 19:12:43,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-08-30 19:12:43,018 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 19:12:43,018 INFO L513 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 19:12:43,046 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-08-30 19:12:43,243 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 19:12:43,244 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting getNumbers2Err1REQUIRES_VIOLATION === [getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION (and 13 more)] === [2021-08-30 19:12:43,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 19:12:43,245 INFO L82 PathProgramCache]: Analyzing trace with hash -554526955, now seen corresponding path program 2 times [2021-08-30 19:12:43,245 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 19:12:43,245 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477254838] [2021-08-30 19:12:43,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 19:12:43,245 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 19:12:43,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:12:43,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 19:12:43,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:12:43,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-08-30 19:12:43,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:12:43,494 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 126 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 19:12:43,495 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 19:12:43,495 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477254838] [2021-08-30 19:12:43,495 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477254838] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 19:12:43,495 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [205863961] [2021-08-30 19:12:43,495 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-30 19:12:43,495 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 19:12:43,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 19:12:43,497 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-08-30 19:12:43,523 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-08-30 19:12:43,551 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-08-30 19:12:43,552 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-30 19:12:43,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 24 conjunts are in the unsatisfiable core [2021-08-30 19:12:43,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 19:12:43,591 INFO L354 Elim1Store]: treesize reduction 83, result has 23.9 percent of original size [2021-08-30 19:12:43,592 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 15 treesize of output 31 [2021-08-30 19:12:43,908 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2021-08-30 19:12:43,909 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-08-30 19:12:43,909 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [205863961] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 19:12:43,909 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-30 19:12:43,909 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [17] total 22 [2021-08-30 19:12:43,909 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773828117] [2021-08-30 19:12:43,910 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-30 19:12:43,910 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 19:12:43,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-30 19:12:43,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=409, Unknown=0, NotChecked=0, Total=506 [2021-08-30 19:12:43,911 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-30 19:12:44,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 19:12:44,059 INFO L93 Difference]: Finished difference Result 99 states and 103 transitions. [2021-08-30 19:12:44,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-30 19:12:44,060 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 47 [2021-08-30 19:12:44,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 19:12:44,061 INFO L225 Difference]: With dead ends: 99 [2021-08-30 19:12:44,061 INFO L226 Difference]: Without dead ends: 99 [2021-08-30 19:12:44,061 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 240.99ms TimeCoverageRelationStatistics Valid=111, Invalid=489, Unknown=0, NotChecked=0, Total=600 [2021-08-30 19:12:44,062 INFO L928 BasicCegarLoop]: 11 mSDtfsCounter, 62 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 97.63ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.39ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 127.10ms IncrementalHoareTripleChecker+Time [2021-08-30 19:12:44,062 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 14 Invalid, 258 Unknown, 0 Unchecked, 1.39ms Time], IncrementalHoareTripleChecker [4 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 127.10ms Time] [2021-08-30 19:12:44,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-08-30 19:12:44,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 94. [2021-08-30 19:12:44,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 69 states have (on average 1.2608695652173914) internal successors, (87), 82 states have internal predecessors, (87), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-30 19:12:44,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 98 transitions. [2021-08-30 19:12:44,066 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 98 transitions. Word has length 47 [2021-08-30 19:12:44,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 19:12:44,067 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 98 transitions. [2021-08-30 19:12:44,067 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-30 19:12:44,067 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 98 transitions. [2021-08-30 19:12:44,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-08-30 19:12:44,068 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 19:12:44,068 INFO L513 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 19:12:44,089 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-08-30 19:12:44,288 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 19:12:44,288 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting getNumbers2Err2REQUIRES_VIOLATION === [getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION (and 13 more)] === [2021-08-30 19:12:44,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 19:12:44,289 INFO L82 PathProgramCache]: Analyzing trace with hash -10466397, now seen corresponding path program 1 times [2021-08-30 19:12:44,289 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 19:12:44,289 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981523268] [2021-08-30 19:12:44,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 19:12:44,289 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 19:12:44,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:12:44,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 19:12:44,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:12:44,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-08-30 19:12:44,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:12:44,374 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2021-08-30 19:12:44,375 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 19:12:44,375 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981523268] [2021-08-30 19:12:44,375 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981523268] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 19:12:44,375 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-30 19:12:44,375 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-30 19:12:44,375 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718538430] [2021-08-30 19:12:44,376 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-30 19:12:44,376 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 19:12:44,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-30 19:12:44,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-30 19:12:44,377 INFO L87 Difference]: Start difference. First operand 94 states and 98 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-30 19:12:44,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 19:12:44,525 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2021-08-30 19:12:44,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-30 19:12:44,525 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 48 [2021-08-30 19:12:44,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 19:12:44,526 INFO L225 Difference]: With dead ends: 93 [2021-08-30 19:12:44,526 INFO L226 Difference]: Without dead ends: 93 [2021-08-30 19:12:44,527 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 38.74ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-08-30 19:12:44,527 INFO L928 BasicCegarLoop]: 9 mSDtfsCounter, 29 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 91.70ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.21ms SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 124.44ms IncrementalHoareTripleChecker+Time [2021-08-30 19:12:44,528 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 11 Invalid, 213 Unknown, 0 Unchecked, 1.21ms Time], IncrementalHoareTripleChecker [9 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 124.44ms Time] [2021-08-30 19:12:44,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-08-30 19:12:44,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2021-08-30 19:12:44,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 69 states have (on average 1.2463768115942029) internal successors, (86), 81 states have internal predecessors, (86), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-30 19:12:44,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2021-08-30 19:12:44,532 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 48 [2021-08-30 19:12:44,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 19:12:44,532 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2021-08-30 19:12:44,532 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-30 19:12:44,533 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2021-08-30 19:12:44,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-08-30 19:12:44,533 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 19:12:44,533 INFO L513 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 19:12:44,534 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-30 19:12:44,534 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting getNumbers2Err3REQUIRES_VIOLATION === [getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION (and 13 more)] === [2021-08-30 19:12:44,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 19:12:44,534 INFO L82 PathProgramCache]: Analyzing trace with hash -10466396, now seen corresponding path program 1 times [2021-08-30 19:12:44,534 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 19:12:44,535 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674923097] [2021-08-30 19:12:44,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 19:12:44,535 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 19:12:44,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:12:44,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 19:12:44,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:12:44,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-08-30 19:12:44,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:12:44,636 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2021-08-30 19:12:44,637 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 19:12:44,637 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674923097] [2021-08-30 19:12:44,637 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674923097] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 19:12:44,637 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-30 19:12:44,637 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-30 19:12:44,638 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773795410] [2021-08-30 19:12:44,638 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-30 19:12:44,638 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 19:12:44,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-30 19:12:44,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-30 19:12:44,639 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-30 19:12:44,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 19:12:44,813 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2021-08-30 19:12:44,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-30 19:12:44,813 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 48 [2021-08-30 19:12:44,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 19:12:44,814 INFO L225 Difference]: With dead ends: 96 [2021-08-30 19:12:44,814 INFO L226 Difference]: Without dead ends: 96 [2021-08-30 19:12:44,815 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 49.41ms TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-08-30 19:12:44,815 INFO L928 BasicCegarLoop]: 7 mSDtfsCounter, 63 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 118.41ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.44ms SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 146.30ms IncrementalHoareTripleChecker+Time [2021-08-30 19:12:44,815 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 10 Invalid, 254 Unknown, 0 Unchecked, 1.44ms Time], IncrementalHoareTripleChecker [10 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 146.30ms Time] [2021-08-30 19:12:44,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-08-30 19:12:44,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2021-08-30 19:12:44,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 70 states have (on average 1.2428571428571429) internal successors, (87), 82 states have internal predecessors, (87), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-30 19:12:44,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 98 transitions. [2021-08-30 19:12:44,820 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 98 transitions. Word has length 48 [2021-08-30 19:12:44,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 19:12:44,820 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 98 transitions. [2021-08-30 19:12:44,820 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-30 19:12:44,820 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 98 transitions. [2021-08-30 19:12:44,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-08-30 19:12:44,821 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 19:12:44,821 INFO L513 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 19:12:44,822 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-30 19:12:44,822 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting getNumbers2Err1REQUIRES_VIOLATION === [getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION (and 13 more)] === [2021-08-30 19:12:44,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 19:12:44,822 INFO L82 PathProgramCache]: Analyzing trace with hash 2035746631, now seen corresponding path program 1 times [2021-08-30 19:12:44,822 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 19:12:44,823 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664789289] [2021-08-30 19:12:44,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 19:12:44,823 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 19:12:44,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:12:44,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 19:12:44,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:12:44,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-08-30 19:12:44,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:12:45,078 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 126 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 19:12:45,078 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 19:12:45,078 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664789289] [2021-08-30 19:12:45,079 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664789289] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 19:12:45,079 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [81492095] [2021-08-30 19:12:45,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 19:12:45,079 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 19:12:45,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 19:12:45,080 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-08-30 19:12:45,088 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-08-30 19:12:45,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:12:45,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 29 conjunts are in the unsatisfiable core [2021-08-30 19:12:45,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 19:12:45,818 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 126 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 19:12:45,818 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 19:12:46,053 INFO L388 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 26 treesize of output 22 [2021-08-30 19:12:46,186 INFO L388 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 18 treesize of output 14 [2021-08-30 19:12:46,552 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 126 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 19:12:46,552 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [81492095] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 19:12:46,552 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 19:12:46,552 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 51 [2021-08-30 19:12:46,552 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408603017] [2021-08-30 19:12:46,553 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2021-08-30 19:12:46,553 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 19:12:46,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2021-08-30 19:12:46,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=538, Invalid=2114, Unknown=0, NotChecked=0, Total=2652 [2021-08-30 19:12:46,555 INFO L87 Difference]: Start difference. First operand 94 states and 98 transitions. Second operand has 52 states, 51 states have (on average 2.588235294117647) internal successors, (132), 46 states have internal predecessors, (132), 4 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2021-08-30 19:12:47,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 19:12:47,635 INFO L93 Difference]: Finished difference Result 116 states and 122 transitions. [2021-08-30 19:12:47,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-08-30 19:12:47,636 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 2.588235294117647) internal successors, (132), 46 states have internal predecessors, (132), 4 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 52 [2021-08-30 19:12:47,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 19:12:47,639 INFO L225 Difference]: With dead ends: 116 [2021-08-30 19:12:47,639 INFO L226 Difference]: Without dead ends: 116 [2021-08-30 19:12:47,641 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1229 ImplicationChecksByTransitivity, 1317.62ms TimeCoverageRelationStatistics Valid=1041, Invalid=3929, Unknown=0, NotChecked=0, Total=4970 [2021-08-30 19:12:47,642 INFO L928 BasicCegarLoop]: 7 mSDtfsCounter, 267 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 441.52ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 1110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.47ms SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 556.30ms IncrementalHoareTripleChecker+Time [2021-08-30 19:12:47,642 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [267 Valid, 21 Invalid, 1110 Unknown, 0 Unchecked, 6.47ms Time], IncrementalHoareTripleChecker [70 Valid, 1040 Invalid, 0 Unknown, 0 Unchecked, 556.30ms Time] [2021-08-30 19:12:47,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-08-30 19:12:47,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 108. [2021-08-30 19:12:47,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 84 states have (on average 1.25) internal successors, (105), 96 states have internal predecessors, (105), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-30 19:12:47,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2021-08-30 19:12:47,646 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 52 [2021-08-30 19:12:47,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 19:12:47,646 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2021-08-30 19:12:47,647 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 2.588235294117647) internal successors, (132), 46 states have internal predecessors, (132), 4 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2021-08-30 19:12:47,647 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2021-08-30 19:12:47,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-08-30 19:12:47,647 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 19:12:47,648 INFO L513 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 19:12:47,681 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-08-30 19:12:47,848 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 19:12:47,848 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting getNumbers2Err3REQUIRES_VIOLATION === [getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION (and 13 more)] === [2021-08-30 19:12:47,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 19:12:47,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1316363854, now seen corresponding path program 1 times [2021-08-30 19:12:47,849 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 19:12:47,849 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870248971] [2021-08-30 19:12:47,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 19:12:47,849 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 19:12:47,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:12:47,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 19:12:47,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:12:47,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-08-30 19:12:47,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:12:47,989 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2021-08-30 19:12:47,989 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 19:12:47,989 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870248971] [2021-08-30 19:12:47,989 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870248971] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 19:12:47,989 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [946060579] [2021-08-30 19:12:47,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 19:12:47,990 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 19:12:47,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 19:12:47,993 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-08-30 19:12:48,016 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-08-30 19:12:48,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:12:48,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 15 conjunts are in the unsatisfiable core [2021-08-30 19:12:48,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 19:12:48,102 INFO L354 Elim1Store]: treesize reduction 86, result has 21.1 percent of original size [2021-08-30 19:12:48,103 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 33 treesize of output 45 [2021-08-30 19:12:48,106 INFO L388 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 236 treesize of output 220 [2021-08-30 19:12:49,417 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2021-08-30 19:12:49,418 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 19:12:49,613 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2021-08-30 19:12:49,613 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [946060579] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 19:12:49,614 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 19:12:49,614 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 12 [2021-08-30 19:12:49,614 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384658218] [2021-08-30 19:12:49,614 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-30 19:12:49,615 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 19:12:49,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-30 19:12:49,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2021-08-30 19:12:49,615 INFO L87 Difference]: Start difference. First operand 108 states and 116 transitions. Second operand has 13 states, 12 states have (on average 4.0) internal successors, (48), 11 states have internal predecessors, (48), 4 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2021-08-30 19:12:49,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 19:12:49,772 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2021-08-30 19:12:49,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-30 19:12:49,772 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.0) internal successors, (48), 11 states have internal predecessors, (48), 4 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) Word has length 53 [2021-08-30 19:12:49,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 19:12:49,773 INFO L225 Difference]: With dead ends: 111 [2021-08-30 19:12:49,773 INFO L226 Difference]: Without dead ends: 111 [2021-08-30 19:12:49,774 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 107.03ms TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2021-08-30 19:12:49,774 INFO L928 BasicCegarLoop]: 10 mSDtfsCounter, 3 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 111.06ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.56ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 52 IncrementalHoareTripleChecker+Unchecked, 134.82ms IncrementalHoareTripleChecker+Time [2021-08-30 19:12:49,774 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 18 Invalid, 346 Unknown, 0 Unchecked, 1.56ms Time], IncrementalHoareTripleChecker [1 Valid, 293 Invalid, 0 Unknown, 52 Unchecked, 134.82ms Time] [2021-08-30 19:12:49,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-08-30 19:12:49,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 108. [2021-08-30 19:12:49,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 84 states have (on average 1.2261904761904763) internal successors, (103), 96 states have internal predecessors, (103), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-30 19:12:49,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 114 transitions. [2021-08-30 19:12:49,777 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 114 transitions. Word has length 53 [2021-08-30 19:12:49,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 19:12:49,778 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 114 transitions. [2021-08-30 19:12:49,778 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.0) internal successors, (48), 11 states have internal predecessors, (48), 4 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2021-08-30 19:12:49,778 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 114 transitions. [2021-08-30 19:12:49,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-08-30 19:12:49,779 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 19:12:49,779 INFO L513 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 19:12:49,807 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-08-30 19:12:50,003 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 19:12:50,003 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting getNumbers3Err0REQUIRES_VIOLATION === [getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION (and 13 more)] === [2021-08-30 19:12:50,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 19:12:50,004 INFO L82 PathProgramCache]: Analyzing trace with hash -317183978, now seen corresponding path program 1 times [2021-08-30 19:12:50,006 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 19:12:50,006 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858158949] [2021-08-30 19:12:50,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 19:12:50,006 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 19:12:50,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:12:50,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 19:12:50,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:12:50,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 19:12:50,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:12:50,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 19:12:50,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:12:50,107 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2021-08-30 19:12:50,107 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 19:12:50,107 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858158949] [2021-08-30 19:12:50,107 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858158949] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 19:12:50,107 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160894336] [2021-08-30 19:12:50,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 19:12:50,108 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 19:12:50,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 19:12:50,113 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-08-30 19:12:50,114 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-08-30 19:12:50,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:12:50,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-30 19:12:50,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 19:12:50,286 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2021-08-30 19:12:50,286 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 19:12:50,418 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2021-08-30 19:12:50,418 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [160894336] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 19:12:50,418 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 19:12:50,418 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 10 [2021-08-30 19:12:50,419 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718993913] [2021-08-30 19:12:50,419 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-30 19:12:50,419 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 19:12:50,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-30 19:12:50,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-08-30 19:12:50,420 INFO L87 Difference]: Start difference. First operand 108 states and 114 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-08-30 19:12:50,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 19:12:50,612 INFO L93 Difference]: Finished difference Result 120 states and 124 transitions. [2021-08-30 19:12:50,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-30 19:12:50,613 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 62 [2021-08-30 19:12:50,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 19:12:50,614 INFO L225 Difference]: With dead ends: 120 [2021-08-30 19:12:50,614 INFO L226 Difference]: Without dead ends: 120 [2021-08-30 19:12:50,614 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 44.91ms TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-08-30 19:12:50,615 INFO L928 BasicCegarLoop]: 11 mSDtfsCounter, 32 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 145.57ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.73ms SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 182.96ms IncrementalHoareTripleChecker+Time [2021-08-30 19:12:50,615 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 46 Invalid, 366 Unknown, 0 Unchecked, 2.73ms Time], IncrementalHoareTripleChecker [12 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 182.96ms Time] [2021-08-30 19:12:50,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2021-08-30 19:12:50,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 117. [2021-08-30 19:12:50,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 93 states have (on average 1.2150537634408602) internal successors, (113), 105 states have internal predecessors, (113), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-30 19:12:50,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 124 transitions. [2021-08-30 19:12:50,618 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 124 transitions. Word has length 62 [2021-08-30 19:12:50,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 19:12:50,618 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 124 transitions. [2021-08-30 19:12:50,618 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-08-30 19:12:50,618 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 124 transitions. [2021-08-30 19:12:50,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-08-30 19:12:50,619 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 19:12:50,619 INFO L513 BasicCegarLoop]: trace histogram [10, 10, 10, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 19:12:50,643 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-08-30 19:12:50,820 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,SelfDestructingSolverStorable12 [2021-08-30 19:12:50,820 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting getNumbers2Err3REQUIRES_VIOLATION === [getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION (and 13 more)] === [2021-08-30 19:12:50,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 19:12:50,820 INFO L82 PathProgramCache]: Analyzing trace with hash -134627086, now seen corresponding path program 2 times [2021-08-30 19:12:50,821 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 19:12:50,821 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234100041] [2021-08-30 19:12:50,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 19:12:50,821 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 19:12:50,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:12:50,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 19:12:50,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:12:50,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-08-30 19:12:50,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:12:50,978 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2021-08-30 19:12:50,978 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 19:12:50,979 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234100041] [2021-08-30 19:12:50,979 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234100041] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 19:12:50,979 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675975956] [2021-08-30 19:12:50,979 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-30 19:12:50,979 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 19:12:50,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 19:12:50,980 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-08-30 19:12:51,006 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-08-30 19:12:51,036 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-08-30 19:12:51,036 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-30 19:12:51,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 17 conjunts are in the unsatisfiable core [2021-08-30 19:12:51,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 19:12:51,078 INFO L354 Elim1Store]: treesize reduction 86, result has 21.1 percent of original size [2021-08-30 19:12:51,078 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 33 treesize of output 45 [2021-08-30 19:12:51,082 INFO L388 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 124 treesize of output 120 [2021-08-30 19:12:52,815 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2021-08-30 19:12:52,816 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 19:12:53,537 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2021-08-30 19:12:53,537 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [675975956] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 19:12:53,537 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 19:12:53,537 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 20 [2021-08-30 19:12:53,538 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248997494] [2021-08-30 19:12:53,538 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-08-30 19:12:53,538 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 19:12:53,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-08-30 19:12:53,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2021-08-30 19:12:53,539 INFO L87 Difference]: Start difference. First operand 117 states and 124 transitions. Second operand has 21 states, 20 states have (on average 3.0) internal successors, (60), 17 states have internal predecessors, (60), 4 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2021-08-30 19:12:54,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 19:12:54,030 INFO L93 Difference]: Finished difference Result 116 states and 121 transitions. [2021-08-30 19:12:54,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-30 19:12:54,031 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.0) internal successors, (60), 17 states have internal predecessors, (60), 4 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 63 [2021-08-30 19:12:54,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 19:12:54,031 INFO L225 Difference]: With dead ends: 116 [2021-08-30 19:12:54,031 INFO L226 Difference]: Without dead ends: 116 [2021-08-30 19:12:54,032 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 118 SyntacticMatches, 8 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 491.91ms TimeCoverageRelationStatistics Valid=129, Invalid=573, Unknown=0, NotChecked=0, Total=702 [2021-08-30 19:12:54,032 INFO L928 BasicCegarLoop]: 11 mSDtfsCounter, 0 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 231.81ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.30ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 220 IncrementalHoareTripleChecker+Unchecked, 285.35ms IncrementalHoareTripleChecker+Time [2021-08-30 19:12:54,033 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 765 Unknown, 0 Unchecked, 2.30ms Time], IncrementalHoareTripleChecker [1 Valid, 544 Invalid, 0 Unknown, 220 Unchecked, 285.35ms Time] [2021-08-30 19:12:54,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-08-30 19:12:54,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2021-08-30 19:12:54,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 93 states have (on average 1.1827956989247312) internal successors, (110), 104 states have internal predecessors, (110), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-30 19:12:54,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 121 transitions. [2021-08-30 19:12:54,036 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 121 transitions. Word has length 63 [2021-08-30 19:12:54,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 19:12:54,036 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 121 transitions. [2021-08-30 19:12:54,036 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.0) internal successors, (60), 17 states have internal predecessors, (60), 4 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2021-08-30 19:12:54,036 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 121 transitions. [2021-08-30 19:12:54,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-08-30 19:12:54,037 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 19:12:54,037 INFO L513 BasicCegarLoop]: trace histogram [10, 10, 10, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 19:12:54,067 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-08-30 19:12:54,248 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-08-30 19:12:54,249 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting getNumbers2Err1REQUIRES_VIOLATION === [getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION (and 13 more)] === [2021-08-30 19:12:54,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 19:12:54,249 INFO L82 PathProgramCache]: Analyzing trace with hash -226941547, now seen corresponding path program 2 times [2021-08-30 19:12:54,249 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 19:12:54,249 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888879235] [2021-08-30 19:12:54,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 19:12:54,250 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 19:12:54,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:12:54,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 19:12:54,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:12:54,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-08-30 19:12:54,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:12:54,591 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 126 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 19:12:54,592 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 19:12:54,592 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888879235] [2021-08-30 19:12:54,592 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888879235] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 19:12:54,592 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1911134428] [2021-08-30 19:12:54,592 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-30 19:12:54,592 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 19:12:54,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 19:12:54,595 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-08-30 19:12:54,596 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-08-30 19:12:54,657 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-30 19:12:54,657 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-30 19:12:54,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 28 conjunts are in the unsatisfiable core [2021-08-30 19:12:54,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 19:12:54,700 INFO L354 Elim1Store]: treesize reduction 83, result has 23.9 percent of original size [2021-08-30 19:12:54,701 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 15 treesize of output 31 [2021-08-30 19:12:55,316 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2021-08-30 19:12:55,316 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-08-30 19:12:55,317 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1911134428] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 19:12:55,317 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-30 19:12:55,317 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [21] total 31 [2021-08-30 19:12:55,317 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570500608] [2021-08-30 19:12:55,317 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-30 19:12:55,317 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 19:12:55,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-30 19:12:55,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=863, Unknown=0, NotChecked=0, Total=992 [2021-08-30 19:12:55,318 INFO L87 Difference]: Start difference. First operand 116 states and 121 transitions. Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-30 19:12:55,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 19:12:55,607 INFO L93 Difference]: Finished difference Result 115 states and 119 transitions. [2021-08-30 19:12:55,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-30 19:12:55,607 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 67 [2021-08-30 19:12:55,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 19:12:55,608 INFO L225 Difference]: With dead ends: 115 [2021-08-30 19:12:55,608 INFO L226 Difference]: Without dead ends: 115 [2021-08-30 19:12:55,609 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 559.11ms TimeCoverageRelationStatistics Valid=202, Invalid=1280, Unknown=0, NotChecked=0, Total=1482 [2021-08-30 19:12:55,610 INFO L928 BasicCegarLoop]: 11 mSDtfsCounter, 59 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 154.50ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.69ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 187.64ms IncrementalHoareTripleChecker+Time [2021-08-30 19:12:55,610 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 16 Invalid, 443 Unknown, 0 Unchecked, 1.69ms Time], IncrementalHoareTripleChecker [4 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 187.64ms Time] [2021-08-30 19:12:55,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-08-30 19:12:55,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2021-08-30 19:12:55,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 93 states have (on average 1.1612903225806452) internal successors, (108), 103 states have internal predecessors, (108), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-30 19:12:55,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 119 transitions. [2021-08-30 19:12:55,614 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 119 transitions. Word has length 67 [2021-08-30 19:12:55,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 19:12:55,614 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 119 transitions. [2021-08-30 19:12:55,614 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-30 19:12:55,614 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 119 transitions. [2021-08-30 19:12:55,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-08-30 19:12:55,615 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 19:12:55,615 INFO L513 BasicCegarLoop]: trace histogram [10, 10, 10, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 19:12:55,635 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2021-08-30 19:12:55,825 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,SelfDestructingSolverStorable14 [2021-08-30 19:12:55,825 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting getNumbers3Err0REQUIRES_VIOLATION === [getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION (and 13 more)] === [2021-08-30 19:12:55,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 19:12:55,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1322437014, now seen corresponding path program 2 times [2021-08-30 19:12:55,826 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 19:12:55,826 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486131735] [2021-08-30 19:12:55,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 19:12:55,826 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 19:12:55,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:12:55,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 19:12:55,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:12:55,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 19:12:55,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:12:55,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 19:12:55,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:12:55,959 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2021-08-30 19:12:55,960 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 19:12:55,960 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486131735] [2021-08-30 19:12:55,960 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486131735] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 19:12:55,960 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640765357] [2021-08-30 19:12:55,960 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-30 19:12:55,961 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 19:12:55,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 19:12:55,962 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-08-30 19:12:55,963 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-08-30 19:12:56,015 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-08-30 19:12:56,016 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-30 19:12:56,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 16 conjunts are in the unsatisfiable core [2021-08-30 19:12:56,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 19:12:56,079 INFO L354 Elim1Store]: treesize reduction 151, result has 18.4 percent of original size [2021-08-30 19:12:56,079 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 101 treesize of output 119 [2021-08-30 19:13:15,199 INFO L354 Elim1Store]: treesize reduction 114, result has 35.2 percent of original size [2021-08-30 19:13:15,200 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 57 treesize of output 107 [2021-08-30 19:13:16,083 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2021-08-30 19:13:16,083 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-08-30 19:13:16,084 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [640765357] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 19:13:16,084 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-30 19:13:16,084 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 15 [2021-08-30 19:13:16,084 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873126661] [2021-08-30 19:13:16,084 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-30 19:13:16,084 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 19:13:16,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-30 19:13:16,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2021-08-30 19:13:16,085 INFO L87 Difference]: Start difference. First operand 115 states and 119 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-08-30 19:13:16,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 19:13:16,130 INFO L93 Difference]: Finished difference Result 117 states and 123 transitions. [2021-08-30 19:13:16,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-30 19:13:16,131 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 82 [2021-08-30 19:13:16,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 19:13:16,131 INFO L225 Difference]: With dead ends: 117 [2021-08-30 19:13:16,131 INFO L226 Difference]: Without dead ends: 117 [2021-08-30 19:13:16,132 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 134.98ms TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2021-08-30 19:13:16,132 INFO L928 BasicCegarLoop]: 11 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.15ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.38ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 143 IncrementalHoareTripleChecker+Unchecked, 23.23ms IncrementalHoareTripleChecker+Time [2021-08-30 19:13:16,133 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 18 Invalid, 175 Unknown, 0 Unchecked, 0.38ms Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 143 Unchecked, 23.23ms Time] [2021-08-30 19:13:16,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-08-30 19:13:16,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2021-08-30 19:13:16,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 95 states have (on average 1.1789473684210525) internal successors, (112), 105 states have internal predecessors, (112), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-30 19:13:16,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 123 transitions. [2021-08-30 19:13:16,136 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 123 transitions. Word has length 82 [2021-08-30 19:13:16,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 19:13:16,136 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 123 transitions. [2021-08-30 19:13:16,137 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-08-30 19:13:16,137 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 123 transitions. [2021-08-30 19:13:16,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-08-30 19:13:16,138 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 19:13:16,138 INFO L513 BasicCegarLoop]: trace histogram [10, 10, 10, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 19:13:16,168 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-08-30 19:13:16,352 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,SelfDestructingSolverStorable15 [2021-08-30 19:13:16,353 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting getNumbers3Err1REQUIRES_VIOLATION === [getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION (and 13 more)] === [2021-08-30 19:13:16,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 19:13:16,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1322437015, now seen corresponding path program 1 times [2021-08-30 19:13:16,353 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 19:13:16,353 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898333660] [2021-08-30 19:13:16,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 19:13:16,354 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 19:13:16,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:13:16,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 19:13:16,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:13:16,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 19:13:16,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:13:16,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 19:13:16,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:13:16,474 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2021-08-30 19:13:16,475 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 19:13:16,475 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898333660] [2021-08-30 19:13:16,475 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898333660] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 19:13:16,475 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [57175957] [2021-08-30 19:13:16,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 19:13:16,476 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 19:13:16,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 19:13:16,482 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-08-30 19:13:16,484 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-08-30 19:13:16,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:13:16,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-30 19:13:16,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 19:13:16,687 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2021-08-30 19:13:16,688 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 19:13:16,858 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2021-08-30 19:13:16,859 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [57175957] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 19:13:16,859 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 19:13:16,859 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 14 [2021-08-30 19:13:16,859 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766718746] [2021-08-30 19:13:16,859 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-08-30 19:13:16,860 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 19:13:16,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-30 19:13:16,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2021-08-30 19:13:16,860 INFO L87 Difference]: Start difference. First operand 117 states and 123 transitions. Second operand has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 12 states have internal predecessors, (65), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-08-30 19:13:17,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 19:13:17,065 INFO L93 Difference]: Finished difference Result 137 states and 143 transitions. [2021-08-30 19:13:17,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-30 19:13:17,074 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 12 states have internal predecessors, (65), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 82 [2021-08-30 19:13:17,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 19:13:17,075 INFO L225 Difference]: With dead ends: 137 [2021-08-30 19:13:17,075 INFO L226 Difference]: Without dead ends: 137 [2021-08-30 19:13:17,076 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 166 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 76.13ms TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2021-08-30 19:13:17,076 INFO L928 BasicCegarLoop]: 11 mSDtfsCounter, 42 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 158.93ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.76ms SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 195.30ms IncrementalHoareTripleChecker+Time [2021-08-30 19:13:17,077 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 68 Invalid, 464 Unknown, 0 Unchecked, 1.76ms Time], IncrementalHoareTripleChecker [10 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 195.30ms Time] [2021-08-30 19:13:17,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2021-08-30 19:13:17,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2021-08-30 19:13:17,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 115 states have (on average 1.1478260869565218) internal successors, (132), 125 states have internal predecessors, (132), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-30 19:13:17,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 143 transitions. [2021-08-30 19:13:17,081 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 143 transitions. Word has length 82 [2021-08-30 19:13:17,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 19:13:17,081 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 143 transitions. [2021-08-30 19:13:17,081 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 12 states have internal predecessors, (65), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-08-30 19:13:17,081 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 143 transitions. [2021-08-30 19:13:17,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-08-30 19:13:17,082 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 19:13:17,082 INFO L513 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 19:13:17,113 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-08-30 19:13:17,296 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,SelfDestructingSolverStorable16 [2021-08-30 19:13:17,297 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting getNumbers3Err1REQUIRES_VIOLATION === [getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION (and 13 more)] === [2021-08-30 19:13:17,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 19:13:17,297 INFO L82 PathProgramCache]: Analyzing trace with hash 242068247, now seen corresponding path program 2 times [2021-08-30 19:13:17,297 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 19:13:17,297 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477595576] [2021-08-30 19:13:17,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 19:13:17,297 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 19:13:17,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:13:17,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 19:13:17,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:13:17,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 19:13:17,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:13:17,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 19:13:17,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:13:17,522 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2021-08-30 19:13:17,522 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 19:13:17,522 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477595576] [2021-08-30 19:13:17,523 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477595576] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 19:13:17,523 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-30 19:13:17,523 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-30 19:13:17,523 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332641398] [2021-08-30 19:13:17,523 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-30 19:13:17,524 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 19:13:17,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-30 19:13:17,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-08-30 19:13:17,524 INFO L87 Difference]: Start difference. First operand 137 states and 143 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-30 19:13:17,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 19:13:17,832 INFO L93 Difference]: Finished difference Result 142 states and 146 transitions. [2021-08-30 19:13:17,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-30 19:13:17,833 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 102 [2021-08-30 19:13:17,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 19:13:17,833 INFO L225 Difference]: With dead ends: 142 [2021-08-30 19:13:17,833 INFO L226 Difference]: Without dead ends: 142 [2021-08-30 19:13:17,834 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 178.17ms TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2021-08-30 19:13:17,834 INFO L928 BasicCegarLoop]: 7 mSDtfsCounter, 96 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 142.55ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.67ms SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 173.76ms IncrementalHoareTripleChecker+Time [2021-08-30 19:13:17,834 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 13 Invalid, 360 Unknown, 0 Unchecked, 1.67ms Time], IncrementalHoareTripleChecker [30 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 173.76ms Time] [2021-08-30 19:13:17,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2021-08-30 19:13:17,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 137. [2021-08-30 19:13:17,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 115 states have (on average 1.1304347826086956) internal successors, (130), 125 states have internal predecessors, (130), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-30 19:13:17,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 141 transitions. [2021-08-30 19:13:17,839 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 141 transitions. Word has length 102 [2021-08-30 19:13:17,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 19:13:17,839 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 141 transitions. [2021-08-30 19:13:17,839 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-30 19:13:17,839 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 141 transitions. [2021-08-30 19:13:17,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-08-30 19:13:17,840 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 19:13:17,840 INFO L513 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 19:13:17,840 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-30 19:13:17,841 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting getNumbers3Err2REQUIRES_VIOLATION === [getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION (and 13 more)] === [2021-08-30 19:13:17,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 19:13:17,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1085818935, now seen corresponding path program 1 times [2021-08-30 19:13:17,841 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 19:13:17,841 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727685000] [2021-08-30 19:13:17,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 19:13:17,842 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 19:13:17,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:13:17,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 19:13:17,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:13:17,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 19:13:17,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:13:17,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 19:13:17,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:13:17,917 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2021-08-30 19:13:17,917 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 19:13:17,917 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727685000] [2021-08-30 19:13:17,917 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727685000] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 19:13:17,918 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-30 19:13:17,918 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-30 19:13:17,918 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615157904] [2021-08-30 19:13:17,918 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-30 19:13:17,918 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 19:13:17,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-30 19:13:17,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-30 19:13:17,919 INFO L87 Difference]: Start difference. First operand 137 states and 141 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2021-08-30 19:13:18,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 19:13:18,010 INFO L93 Difference]: Finished difference Result 136 states and 140 transitions. [2021-08-30 19:13:18,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-30 19:13:18,011 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 103 [2021-08-30 19:13:18,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 19:13:18,012 INFO L225 Difference]: With dead ends: 136 [2021-08-30 19:13:18,012 INFO L226 Difference]: Without dead ends: 136 [2021-08-30 19:13:18,012 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.74ms TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-30 19:13:18,013 INFO L928 BasicCegarLoop]: 11 mSDtfsCounter, 11 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 70.07ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.73ms SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 84.87ms IncrementalHoareTripleChecker+Time [2021-08-30 19:13:18,013 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 17 Invalid, 167 Unknown, 0 Unchecked, 0.73ms Time], IncrementalHoareTripleChecker [9 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 84.87ms Time] [2021-08-30 19:13:18,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2021-08-30 19:13:18,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2021-08-30 19:13:18,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 115 states have (on average 1.1217391304347826) internal successors, (129), 124 states have internal predecessors, (129), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-30 19:13:18,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 140 transitions. [2021-08-30 19:13:18,016 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 140 transitions. Word has length 103 [2021-08-30 19:13:18,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 19:13:18,017 INFO L470 AbstractCegarLoop]: Abstraction has 136 states and 140 transitions. [2021-08-30 19:13:18,017 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2021-08-30 19:13:18,017 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 140 transitions. [2021-08-30 19:13:18,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-08-30 19:13:18,019 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 19:13:18,020 INFO L513 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 19:13:18,020 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-08-30 19:13:18,020 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting getNumbers3Err3REQUIRES_VIOLATION === [getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION (and 13 more)] === [2021-08-30 19:13:18,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 19:13:18,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1085818934, now seen corresponding path program 1 times [2021-08-30 19:13:18,021 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 19:13:18,021 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551836112] [2021-08-30 19:13:18,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 19:13:18,021 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 19:13:18,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:13:18,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 19:13:18,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:13:18,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 19:13:18,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:13:18,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 19:13:18,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:13:18,128 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2021-08-30 19:13:18,128 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 19:13:18,128 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551836112] [2021-08-30 19:13:18,128 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551836112] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 19:13:18,128 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-30 19:13:18,129 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-30 19:13:18,129 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535914130] [2021-08-30 19:13:18,129 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-30 19:13:18,129 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 19:13:18,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-30 19:13:18,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-30 19:13:18,130 INFO L87 Difference]: Start difference. First operand 136 states and 140 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2021-08-30 19:13:18,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 19:13:18,267 INFO L93 Difference]: Finished difference Result 139 states and 143 transitions. [2021-08-30 19:13:18,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-30 19:13:18,267 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 103 [2021-08-30 19:13:18,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 19:13:18,268 INFO L225 Difference]: With dead ends: 139 [2021-08-30 19:13:18,268 INFO L226 Difference]: Without dead ends: 139 [2021-08-30 19:13:18,268 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 23.08ms TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-30 19:13:18,269 INFO L928 BasicCegarLoop]: 11 mSDtfsCounter, 4 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 103.45ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.04ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 129.77ms IncrementalHoareTripleChecker+Time [2021-08-30 19:13:18,269 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 18 Invalid, 229 Unknown, 0 Unchecked, 1.04ms Time], IncrementalHoareTripleChecker [6 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 129.77ms Time] [2021-08-30 19:13:18,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-08-30 19:13:18,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 137. [2021-08-30 19:13:18,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 116 states have (on average 1.1206896551724137) internal successors, (130), 125 states have internal predecessors, (130), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-30 19:13:18,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 141 transitions. [2021-08-30 19:13:18,273 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 141 transitions. Word has length 103 [2021-08-30 19:13:18,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 19:13:18,273 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 141 transitions. [2021-08-30 19:13:18,273 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2021-08-30 19:13:18,273 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 141 transitions. [2021-08-30 19:13:18,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-08-30 19:13:18,274 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 19:13:18,274 INFO L513 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 19:13:18,275 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-08-30 19:13:18,275 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting getNumbers3Err0REQUIRES_VIOLATION === [getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION (and 13 more)] === [2021-08-30 19:13:18,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 19:13:18,275 INFO L82 PathProgramCache]: Analyzing trace with hash -508253588, now seen corresponding path program 1 times [2021-08-30 19:13:18,275 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 19:13:18,275 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607282483] [2021-08-30 19:13:18,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 19:13:18,276 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 19:13:18,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:13:18,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 19:13:18,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:13:18,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 19:13:18,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:13:18,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 19:13:18,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:13:18,355 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2021-08-30 19:13:18,356 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 19:13:18,356 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607282483] [2021-08-30 19:13:18,356 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607282483] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 19:13:18,356 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-30 19:13:18,356 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-30 19:13:18,357 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496547088] [2021-08-30 19:13:18,357 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-30 19:13:18,357 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 19:13:18,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-30 19:13:18,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-30 19:13:18,358 INFO L87 Difference]: Start difference. First operand 137 states and 141 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2021-08-30 19:13:18,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 19:13:18,493 INFO L93 Difference]: Finished difference Result 136 states and 140 transitions. [2021-08-30 19:13:18,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-30 19:13:18,494 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 107 [2021-08-30 19:13:18,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 19:13:18,495 INFO L225 Difference]: With dead ends: 136 [2021-08-30 19:13:18,495 INFO L226 Difference]: Without dead ends: 136 [2021-08-30 19:13:18,495 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 23.10ms TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-30 19:13:18,496 INFO L928 BasicCegarLoop]: 11 mSDtfsCounter, 5 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 100.01ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.93ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 127.96ms IncrementalHoareTripleChecker+Time [2021-08-30 19:13:18,496 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 18 Invalid, 225 Unknown, 0 Unchecked, 0.93ms Time], IncrementalHoareTripleChecker [6 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 127.96ms Time] [2021-08-30 19:13:18,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2021-08-30 19:13:18,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2021-08-30 19:13:18,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 116 states have (on average 1.1120689655172413) internal successors, (129), 124 states have internal predecessors, (129), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-30 19:13:18,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 140 transitions. [2021-08-30 19:13:18,499 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 140 transitions. Word has length 107 [2021-08-30 19:13:18,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 19:13:18,499 INFO L470 AbstractCegarLoop]: Abstraction has 136 states and 140 transitions. [2021-08-30 19:13:18,500 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2021-08-30 19:13:18,500 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 140 transitions. [2021-08-30 19:13:18,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-08-30 19:13:18,501 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 19:13:18,501 INFO L513 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 19:13:18,501 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-08-30 19:13:18,501 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting getNumbers3Err1REQUIRES_VIOLATION === [getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION (and 13 more)] === [2021-08-30 19:13:18,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 19:13:18,502 INFO L82 PathProgramCache]: Analyzing trace with hash -508253587, now seen corresponding path program 1 times [2021-08-30 19:13:18,503 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 19:13:18,503 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194392731] [2021-08-30 19:13:18,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 19:13:18,503 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 19:13:18,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:13:18,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 19:13:18,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:13:18,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 19:13:18,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:13:18,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 19:13:18,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:13:18,738 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 28 proven. 2 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2021-08-30 19:13:18,739 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 19:13:18,739 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194392731] [2021-08-30 19:13:18,739 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194392731] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 19:13:18,739 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216385336] [2021-08-30 19:13:18,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 19:13:18,739 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 19:13:18,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 19:13:18,740 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-08-30 19:13:18,742 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-08-30 19:13:18,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:13:18,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 34 conjunts are in the unsatisfiable core [2021-08-30 19:13:18,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 19:13:19,546 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-08-30 19:13:19,547 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 31 [2021-08-30 19:13:19,551 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-30 19:13:19,551 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 28 [2021-08-30 19:13:19,689 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 207 proven. 30 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2021-08-30 19:13:19,689 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 19:13:19,895 INFO L388 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 51 treesize of output 47 [2021-08-30 19:13:19,908 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-08-30 19:13:19,908 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 47 [2021-08-30 19:13:20,053 INFO L388 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 36 treesize of output 32 [2021-08-30 19:13:21,907 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-08-30 19:13:21,908 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 29 [2021-08-30 19:13:22,016 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 180 proven. 57 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2021-08-30 19:13:22,017 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1216385336] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 19:13:22,017 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 19:13:22,017 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 18, 18] total 43 [2021-08-30 19:13:22,017 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761953812] [2021-08-30 19:13:22,017 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2021-08-30 19:13:22,018 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 19:13:22,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-08-30 19:13:22,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=1537, Unknown=0, NotChecked=0, Total=1892 [2021-08-30 19:13:22,019 INFO L87 Difference]: Start difference. First operand 136 states and 140 transitions. Second operand has 44 states, 43 states have (on average 3.8372093023255816) internal successors, (165), 39 states have internal predecessors, (165), 5 states have call successors, (17), 6 states have call predecessors, (17), 7 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) [2021-08-30 19:13:22,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 19:13:22,930 INFO L93 Difference]: Finished difference Result 146 states and 152 transitions. [2021-08-30 19:13:22,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-08-30 19:13:22,932 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 3.8372093023255816) internal successors, (165), 39 states have internal predecessors, (165), 5 states have call successors, (17), 6 states have call predecessors, (17), 7 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) Word has length 107 [2021-08-30 19:13:22,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 19:13:22,933 INFO L225 Difference]: With dead ends: 146 [2021-08-30 19:13:22,933 INFO L226 Difference]: Without dead ends: 146 [2021-08-30 19:13:22,934 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 199 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 802 ImplicationChecksByTransitivity, 1209.94ms TimeCoverageRelationStatistics Valid=769, Invalid=2891, Unknown=0, NotChecked=0, Total=3660 [2021-08-30 19:13:22,934 INFO L928 BasicCegarLoop]: 8 mSDtfsCounter, 96 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 941 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 348.69ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 1352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.46ms SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 941 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 387 IncrementalHoareTripleChecker+Unchecked, 448.37ms IncrementalHoareTripleChecker+Time [2021-08-30 19:13:22,935 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 28 Invalid, 1352 Unknown, 0 Unchecked, 3.46ms Time], IncrementalHoareTripleChecker [24 Valid, 941 Invalid, 0 Unknown, 387 Unchecked, 448.37ms Time] [2021-08-30 19:13:22,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-08-30 19:13:22,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2021-08-30 19:13:22,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 125 states have (on average 1.128) internal successors, (141), 133 states have internal predecessors, (141), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-30 19:13:22,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 152 transitions. [2021-08-30 19:13:22,938 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 152 transitions. Word has length 107 [2021-08-30 19:13:22,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 19:13:22,938 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 152 transitions. [2021-08-30 19:13:22,938 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 3.8372093023255816) internal successors, (165), 39 states have internal predecessors, (165), 5 states have call successors, (17), 6 states have call predecessors, (17), 7 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) [2021-08-30 19:13:22,939 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 152 transitions. [2021-08-30 19:13:22,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-08-30 19:13:22,939 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 19:13:22,939 INFO L513 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 19:13:22,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-08-30 19:13:23,140 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,SelfDestructingSolverStorable21 [2021-08-30 19:13:23,140 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting getNumbers3Err3REQUIRES_VIOLATION === [getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION (and 13 more)] === [2021-08-30 19:13:23,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 19:13:23,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1424007988, now seen corresponding path program 1 times [2021-08-30 19:13:23,141 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 19:13:23,141 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892791277] [2021-08-30 19:13:23,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 19:13:23,141 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 19:13:23,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:13:23,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 19:13:23,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:13:23,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 19:13:23,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:13:23,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 19:13:23,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:13:23,250 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2021-08-30 19:13:23,250 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 19:13:23,251 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892791277] [2021-08-30 19:13:23,251 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892791277] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 19:13:23,251 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208604937] [2021-08-30 19:13:23,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 19:13:23,251 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 19:13:23,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 19:13:23,253 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-08-30 19:13:23,274 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-08-30 19:13:23,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:13:23,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-30 19:13:23,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 19:13:23,462 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-30 19:13:23,507 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2021-08-30 19:13:23,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 19:13:23,687 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2021-08-30 19:13:23,688 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [208604937] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 19:13:23,688 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 19:13:23,688 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 7 [2021-08-30 19:13:23,688 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878378959] [2021-08-30 19:13:23,688 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-30 19:13:23,688 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 19:13:23,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-30 19:13:23,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-08-30 19:13:23,689 INFO L87 Difference]: Start difference. First operand 145 states and 152 transitions. Second operand has 8 states, 7 states have (on average 5.428571428571429) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2021-08-30 19:13:23,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 19:13:23,864 INFO L93 Difference]: Finished difference Result 154 states and 160 transitions. [2021-08-30 19:13:23,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-30 19:13:23,864 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.428571428571429) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 108 [2021-08-30 19:13:23,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 19:13:23,868 INFO L225 Difference]: With dead ends: 154 [2021-08-30 19:13:23,868 INFO L226 Difference]: Without dead ends: 154 [2021-08-30 19:13:23,868 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 217 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 58.14ms TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-08-30 19:13:23,869 INFO L928 BasicCegarLoop]: 11 mSDtfsCounter, 16 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 134.60ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.89ms SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 156.28ms IncrementalHoareTripleChecker+Time [2021-08-30 19:13:23,869 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 22 Invalid, 257 Unknown, 0 Unchecked, 0.89ms Time], IncrementalHoareTripleChecker [14 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 156.28ms Time] [2021-08-30 19:13:23,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2021-08-30 19:13:23,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 151. [2021-08-30 19:13:23,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 131 states have (on average 1.1221374045801527) internal successors, (147), 139 states have internal predecessors, (147), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-30 19:13:23,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 158 transitions. [2021-08-30 19:13:23,873 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 158 transitions. Word has length 108 [2021-08-30 19:13:23,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 19:13:23,873 INFO L470 AbstractCegarLoop]: Abstraction has 151 states and 158 transitions. [2021-08-30 19:13:23,873 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.428571428571429) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2021-08-30 19:13:23,873 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 158 transitions. [2021-08-30 19:13:23,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-08-30 19:13:23,874 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 19:13:23,875 INFO L513 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 19:13:23,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-08-30 19:13:24,088 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 19:13:24,089 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting getNumbers4Err0REQUIRES_VIOLATION === [getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION (and 13 more)] === [2021-08-30 19:13:24,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 19:13:24,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1387314960, now seen corresponding path program 1 times [2021-08-30 19:13:24,089 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 19:13:24,089 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768777858] [2021-08-30 19:13:24,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 19:13:24,090 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 19:13:24,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:13:24,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 19:13:24,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:13:24,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-30 19:13:24,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:13:24,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 19:13:24,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:13:24,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 19:13:24,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:13:24,216 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2021-08-30 19:13:24,217 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 19:13:24,217 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768777858] [2021-08-30 19:13:24,217 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768777858] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 19:13:24,217 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293407009] [2021-08-30 19:13:24,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 19:13:24,217 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 19:13:24,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 19:13:24,221 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-08-30 19:13:24,247 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-08-30 19:13:24,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:13:24,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-30 19:13:24,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 19:13:24,495 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2021-08-30 19:13:24,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 19:13:24,678 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2021-08-30 19:13:24,679 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293407009] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 19:13:24,679 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 19:13:24,679 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 12 [2021-08-30 19:13:24,679 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467274076] [2021-08-30 19:13:24,680 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-30 19:13:24,680 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 19:13:24,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-30 19:13:24,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-08-30 19:13:24,681 INFO L87 Difference]: Start difference. First operand 151 states and 158 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 9 states have internal predecessors, (55), 3 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2021-08-30 19:13:24,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 19:13:24,863 INFO L93 Difference]: Finished difference Result 162 states and 166 transitions. [2021-08-30 19:13:24,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-30 19:13:24,864 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 9 states have internal predecessors, (55), 3 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 117 [2021-08-30 19:13:24,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 19:13:24,865 INFO L225 Difference]: With dead ends: 162 [2021-08-30 19:13:24,865 INFO L226 Difference]: Without dead ends: 162 [2021-08-30 19:13:24,865 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 55.16ms TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-08-30 19:13:24,865 INFO L928 BasicCegarLoop]: 11 mSDtfsCounter, 34 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 141.17ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.49ms SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 173.59ms IncrementalHoareTripleChecker+Time [2021-08-30 19:13:24,866 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 57 Invalid, 388 Unknown, 0 Unchecked, 1.49ms Time], IncrementalHoareTripleChecker [16 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 173.59ms Time] [2021-08-30 19:13:24,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2021-08-30 19:13:24,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 159. [2021-08-30 19:13:24,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 139 states have (on average 1.1151079136690647) internal successors, (155), 147 states have internal predecessors, (155), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-30 19:13:24,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 166 transitions. [2021-08-30 19:13:24,869 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 166 transitions. Word has length 117 [2021-08-30 19:13:24,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 19:13:24,869 INFO L470 AbstractCegarLoop]: Abstraction has 159 states and 166 transitions. [2021-08-30 19:13:24,869 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 9 states have internal predecessors, (55), 3 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2021-08-30 19:13:24,869 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 166 transitions. [2021-08-30 19:13:24,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-08-30 19:13:24,870 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 19:13:24,870 INFO L513 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 19:13:24,899 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-08-30 19:13:25,080 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 19:13:25,081 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting getNumbers3Err1REQUIRES_VIOLATION === [getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION (and 13 more)] === [2021-08-30 19:13:25,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 19:13:25,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1487004499, now seen corresponding path program 2 times [2021-08-30 19:13:25,081 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 19:13:25,081 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873981293] [2021-08-30 19:13:25,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 19:13:25,082 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 19:13:25,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:13:25,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 19:13:25,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:13:25,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 19:13:25,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:13:25,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 19:13:25,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:13:25,492 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 207 proven. 49 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2021-08-30 19:13:25,492 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 19:13:25,493 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873981293] [2021-08-30 19:13:25,493 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873981293] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 19:13:25,493 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737762729] [2021-08-30 19:13:25,493 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-30 19:13:25,493 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 19:13:25,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 19:13:25,497 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-08-30 19:13:25,524 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-08-30 19:13:25,596 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-30 19:13:25,596 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-30 19:13:25,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 38 conjunts are in the unsatisfiable core [2021-08-30 19:13:25,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 19:13:26,484 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-08-30 19:13:26,485 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 31 [2021-08-30 19:13:26,490 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-30 19:13:26,491 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 28 [2021-08-30 19:13:26,849 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 207 proven. 49 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2021-08-30 19:13:26,849 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 19:13:27,170 INFO L388 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 51 treesize of output 47 [2021-08-30 19:13:27,183 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-08-30 19:13:27,184 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 47 [2021-08-30 19:13:27,353 INFO L388 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 36 treesize of output 32 [2021-08-30 19:13:29,202 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-08-30 19:13:29,202 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 29 [2021-08-30 19:13:29,296 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 180 proven. 76 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2021-08-30 19:13:29,296 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [737762729] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 19:13:29,296 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 19:13:29,297 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20, 20] total 60 [2021-08-30 19:13:29,297 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339457178] [2021-08-30 19:13:29,297 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2021-08-30 19:13:29,297 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 19:13:29,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2021-08-30 19:13:29,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=624, Invalid=3036, Unknown=0, NotChecked=0, Total=3660 [2021-08-30 19:13:29,299 INFO L87 Difference]: Start difference. First operand 159 states and 166 transitions. Second operand has 61 states, 60 states have (on average 3.95) internal successors, (237), 56 states have internal predecessors, (237), 5 states have call successors, (17), 6 states have call predecessors, (17), 7 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) [2021-08-30 19:13:30,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 19:13:30,543 INFO L93 Difference]: Finished difference Result 165 states and 172 transitions. [2021-08-30 19:13:30,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-08-30 19:13:30,544 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 60 states have (on average 3.95) internal successors, (237), 56 states have internal predecessors, (237), 5 states have call successors, (17), 6 states have call predecessors, (17), 7 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) Word has length 117 [2021-08-30 19:13:30,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 19:13:30,545 INFO L225 Difference]: With dead ends: 165 [2021-08-30 19:13:30,545 INFO L226 Difference]: Without dead ends: 165 [2021-08-30 19:13:30,548 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 206 SyntacticMatches, 1 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1937 ImplicationChecksByTransitivity, 2365.75ms TimeCoverageRelationStatistics Valid=1597, Invalid=6959, Unknown=0, NotChecked=0, Total=8556 [2021-08-30 19:13:30,548 INFO L928 BasicCegarLoop]: 8 mSDtfsCounter, 79 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 207.77ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 1323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.51ms SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 667 IncrementalHoareTripleChecker+Unchecked, 259.84ms IncrementalHoareTripleChecker+Time [2021-08-30 19:13:30,548 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 66 Invalid, 1323 Unknown, 0 Unchecked, 2.51ms Time], IncrementalHoareTripleChecker [16 Valid, 640 Invalid, 0 Unknown, 667 Unchecked, 259.84ms Time] [2021-08-30 19:13:30,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2021-08-30 19:13:30,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2021-08-30 19:13:30,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 145 states have (on average 1.110344827586207) internal successors, (161), 153 states have internal predecessors, (161), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-30 19:13:30,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 172 transitions. [2021-08-30 19:13:30,553 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 172 transitions. Word has length 117 [2021-08-30 19:13:30,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 19:13:30,553 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 172 transitions. [2021-08-30 19:13:30,554 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 60 states have (on average 3.95) internal successors, (237), 56 states have internal predecessors, (237), 5 states have call successors, (17), 6 states have call predecessors, (17), 7 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) [2021-08-30 19:13:30,554 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 172 transitions. [2021-08-30 19:13:30,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2021-08-30 19:13:30,555 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 19:13:30,555 INFO L513 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 19:13:30,587 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2021-08-30 19:13:30,781 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,SelfDestructingSolverStorable24 [2021-08-30 19:13:30,781 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting getNumbers3Err3REQUIRES_VIOLATION === [getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION (and 13 more)] === [2021-08-30 19:13:30,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 19:13:30,781 INFO L82 PathProgramCache]: Analyzing trace with hash 417270858, now seen corresponding path program 2 times [2021-08-30 19:13:30,781 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 19:13:30,781 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308480934] [2021-08-30 19:13:30,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 19:13:30,782 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 19:13:30,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:13:30,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 19:13:30,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:13:30,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 19:13:30,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:13:30,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 19:13:30,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:13:30,940 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2021-08-30 19:13:30,940 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 19:13:30,940 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308480934] [2021-08-30 19:13:30,940 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308480934] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 19:13:30,941 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1228441093] [2021-08-30 19:13:30,941 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-30 19:13:30,941 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 19:13:30,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 19:13:30,945 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-08-30 19:13:30,969 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-08-30 19:13:31,009 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-08-30 19:13:31,010 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-30 19:13:31,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-30 19:13:31,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 19:13:31,279 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-30 19:13:31,480 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2021-08-30 19:13:31,480 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 19:13:31,923 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2021-08-30 19:13:31,923 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1228441093] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 19:13:31,923 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 19:13:31,924 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 20 [2021-08-30 19:13:31,924 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443752534] [2021-08-30 19:13:31,924 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-08-30 19:13:31,924 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 19:13:31,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-08-30 19:13:31,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2021-08-30 19:13:31,925 INFO L87 Difference]: Start difference. First operand 165 states and 172 transitions. Second operand has 21 states, 20 states have (on average 3.35) internal successors, (67), 16 states have internal predecessors, (67), 5 states have call successors, (17), 6 states have call predecessors, (17), 7 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) [2021-08-30 19:13:32,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 19:13:32,236 INFO L93 Difference]: Finished difference Result 164 states and 169 transitions. [2021-08-30 19:13:32,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-30 19:13:32,237 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.35) internal successors, (67), 16 states have internal predecessors, (67), 5 states have call successors, (17), 6 states have call predecessors, (17), 7 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) Word has length 123 [2021-08-30 19:13:32,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 19:13:32,238 INFO L225 Difference]: With dead ends: 164 [2021-08-30 19:13:32,238 INFO L226 Difference]: Without dead ends: 164 [2021-08-30 19:13:32,238 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 238 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 264.92ms TimeCoverageRelationStatistics Valid=122, Invalid=580, Unknown=0, NotChecked=0, Total=702 [2021-08-30 19:13:32,239 INFO L928 BasicCegarLoop]: 7 mSDtfsCounter, 117 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 192.42ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.71ms SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 234.18ms IncrementalHoareTripleChecker+Time [2021-08-30 19:13:32,239 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 29 Invalid, 576 Unknown, 0 Unchecked, 1.71ms Time], IncrementalHoareTripleChecker [26 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 234.18ms Time] [2021-08-30 19:13:32,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2021-08-30 19:13:32,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2021-08-30 19:13:32,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 145 states have (on average 1.089655172413793) internal successors, (158), 152 states have internal predecessors, (158), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-30 19:13:32,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 169 transitions. [2021-08-30 19:13:32,243 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 169 transitions. Word has length 123 [2021-08-30 19:13:32,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 19:13:32,243 INFO L470 AbstractCegarLoop]: Abstraction has 164 states and 169 transitions. [2021-08-30 19:13:32,243 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.35) internal successors, (67), 16 states have internal predecessors, (67), 5 states have call successors, (17), 6 states have call predecessors, (17), 7 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) [2021-08-30 19:13:32,244 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 169 transitions. [2021-08-30 19:13:32,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-08-30 19:13:32,245 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 19:13:32,245 INFO L513 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 19:13:32,264 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2021-08-30 19:13:32,456 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-08-30 19:13:32,457 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting getNumbers4Err0REQUIRES_VIOLATION === [getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION (and 13 more)] === [2021-08-30 19:13:32,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 19:13:32,457 INFO L82 PathProgramCache]: Analyzing trace with hash -2070269040, now seen corresponding path program 2 times [2021-08-30 19:13:32,457 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 19:13:32,457 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704252892] [2021-08-30 19:13:32,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 19:13:32,458 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 19:13:32,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:13:32,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 19:13:32,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:13:32,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-30 19:13:32,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:13:32,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 19:13:32,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:13:32,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 19:13:32,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:13:32,628 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2021-08-30 19:13:32,628 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 19:13:32,628 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704252892] [2021-08-30 19:13:32,629 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704252892] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 19:13:32,629 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047894089] [2021-08-30 19:13:32,629 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-30 19:13:32,629 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 19:13:32,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 19:13:32,637 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 19:13:32,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-08-30 19:13:32,734 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-30 19:13:32,734 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-30 19:13:32,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-30 19:13:32,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 19:13:32,944 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2021-08-30 19:13:32,944 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 19:13:33,157 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2021-08-30 19:13:33,157 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2047894089] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 19:13:33,157 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 19:13:33,158 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 16 [2021-08-30 19:13:33,158 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566696829] [2021-08-30 19:13:33,158 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-08-30 19:13:33,158 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 19:13:33,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-08-30 19:13:33,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2021-08-30 19:13:33,159 INFO L87 Difference]: Start difference. First operand 164 states and 169 transitions. Second operand has 16 states, 15 states have (on average 5.333333333333333) internal successors, (80), 13 states have internal predecessors, (80), 3 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2021-08-30 19:13:33,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 19:13:33,314 INFO L93 Difference]: Finished difference Result 180 states and 184 transitions. [2021-08-30 19:13:33,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-30 19:13:33,314 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 5.333333333333333) internal successors, (80), 13 states have internal predecessors, (80), 3 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 137 [2021-08-30 19:13:33,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 19:13:33,315 INFO L225 Difference]: With dead ends: 180 [2021-08-30 19:13:33,315 INFO L226 Difference]: Without dead ends: 180 [2021-08-30 19:13:33,315 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 276 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 86.88ms TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2021-08-30 19:13:33,316 INFO L928 BasicCegarLoop]: 11 mSDtfsCounter, 47 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 116.72ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.96ms SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 148.16ms IncrementalHoareTripleChecker+Time [2021-08-30 19:13:33,316 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 56 Invalid, 351 Unknown, 0 Unchecked, 0.96ms Time], IncrementalHoareTripleChecker [14 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 148.16ms Time] [2021-08-30 19:13:33,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2021-08-30 19:13:33,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 178. [2021-08-30 19:13:33,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 159 states have (on average 1.0880503144654088) internal successors, (173), 166 states have internal predecessors, (173), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-30 19:13:33,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 184 transitions. [2021-08-30 19:13:33,320 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 184 transitions. Word has length 137 [2021-08-30 19:13:33,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 19:13:33,320 INFO L470 AbstractCegarLoop]: Abstraction has 178 states and 184 transitions. [2021-08-30 19:13:33,320 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 5.333333333333333) internal successors, (80), 13 states have internal predecessors, (80), 3 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2021-08-30 19:13:33,320 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 184 transitions. [2021-08-30 19:13:33,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-08-30 19:13:33,321 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 19:13:33,322 INFO L513 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 19:13:33,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-08-30 19:13:33,540 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-08-30 19:13:33,540 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting getNumbers3Err1REQUIRES_VIOLATION === [getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION (and 13 more)] === [2021-08-30 19:13:33,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 19:13:33,541 INFO L82 PathProgramCache]: Analyzing trace with hash -649621203, now seen corresponding path program 3 times [2021-08-30 19:13:33,541 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 19:13:33,541 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877861946] [2021-08-30 19:13:33,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 19:13:33,541 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 19:13:33,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:13:33,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 19:13:33,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:13:33,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 19:13:33,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:13:33,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 19:13:33,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 19:13:33,876 INFO L134 CoverageAnalysis]: Checked inductivity of 499 backedges. 28 proven. 119 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2021-08-30 19:13:33,877 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 19:13:33,877 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877861946] [2021-08-30 19:13:33,877 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877861946] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 19:13:33,877 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [733085510] [2021-08-30 19:13:33,877 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-30 19:13:33,877 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 19:13:33,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 19:13:33,889 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 19:13:33,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-08-30 19:13:33,956 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-08-30 19:13:33,956 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-30 19:13:33,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 23 conjunts are in the unsatisfiable core [2021-08-30 19:13:33,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 19:13:34,002 INFO L354 Elim1Store]: treesize reduction 86, result has 21.1 percent of original size [2021-08-30 19:13:34,002 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 33 treesize of output 45 [2021-08-30 19:13:34,005 INFO L388 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 110 treesize of output 108 [2021-08-30 19:13:36,208 INFO L354 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2021-08-30 19:13:36,209 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 30 treesize of output 38 [2021-08-30 19:13:37,088 INFO L134 CoverageAnalysis]: Checked inductivity of 499 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 467 trivial. 0 not checked. [2021-08-30 19:13:37,088 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-08-30 19:13:37,088 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [733085510] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 19:13:37,088 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-30 19:13:37,088 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [15] total 22 [2021-08-30 19:13:37,088 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472078045] [2021-08-30 19:13:37,089 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-30 19:13:37,089 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 19:13:37,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-30 19:13:37,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=454, Unknown=0, NotChecked=0, Total=506 [2021-08-30 19:13:37,090 INFO L87 Difference]: Start difference. First operand 178 states and 184 transitions. Second operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-08-30 19:13:37,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 19:13:37,129 INFO L93 Difference]: Finished difference Result 177 states and 181 transitions. [2021-08-30 19:13:37,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-30 19:13:37,129 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 137 [2021-08-30 19:13:37,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 19:13:37,130 INFO L225 Difference]: With dead ends: 177 [2021-08-30 19:13:37,130 INFO L226 Difference]: Without dead ends: 177 [2021-08-30 19:13:37,130 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 347.93ms TimeCoverageRelationStatistics Valid=56, Invalid=496, Unknown=0, NotChecked=0, Total=552 [2021-08-30 19:13:37,131 INFO L928 BasicCegarLoop]: 11 mSDtfsCounter, 0 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.85ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.30ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 188 IncrementalHoareTripleChecker+Unchecked, 15.38ms IncrementalHoareTripleChecker+Time [2021-08-30 19:13:37,131 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 22 Invalid, 214 Unknown, 0 Unchecked, 0.30ms Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 188 Unchecked, 15.38ms Time] [2021-08-30 19:13:37,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2021-08-30 19:13:37,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2021-08-30 19:13:37,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 159 states have (on average 1.069182389937107) internal successors, (170), 165 states have internal predecessors, (170), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-30 19:13:37,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 181 transitions. [2021-08-30 19:13:37,134 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 181 transitions. Word has length 137 [2021-08-30 19:13:37,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 19:13:37,135 INFO L470 AbstractCegarLoop]: Abstraction has 177 states and 181 transitions. [2021-08-30 19:13:37,135 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-08-30 19:13:37,135 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 181 transitions. [2021-08-30 19:13:37,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2021-08-30 19:13:37,136 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 19:13:37,136 INFO L513 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 19:13:37,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2021-08-30 19:13:37,352 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 19:13:37,352 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting getNumbers4Err0REQUIRES_VIOLATION === [getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION (and 13 more)] === [2021-08-30 19:13:37,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 19:13:37,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1136420880, now seen corresponding path program 3 times [2021-08-30 19:13:37,352 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 19:13:37,352 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012319181] [2021-08-30 19:13:37,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 19:13:37,353 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 19:13:37,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-30 19:13:37,423 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-30 19:13:37,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-30 19:13:37,539 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-30 19:13:37,540 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-08-30 19:13:37,541 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location getNumbers4Err0REQUIRES_VIOLATION (16 of 17 remaining) [2021-08-30 19:13:37,542 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location getNumbers4Err1REQUIRES_VIOLATION (15 of 17 remaining) [2021-08-30 19:13:37,542 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location getNumbers4Err2REQUIRES_VIOLATION (14 of 17 remaining) [2021-08-30 19:13:37,542 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location getNumbers4Err3REQUIRES_VIOLATION (13 of 17 remaining) [2021-08-30 19:13:37,543 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr0REQUIRES_VIOLATION (12 of 17 remaining) [2021-08-30 19:13:37,543 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr1REQUIRES_VIOLATION (11 of 17 remaining) [2021-08-30 19:13:37,543 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr2ENSURES_VIOLATIONMEMORY_LEAK (10 of 17 remaining) [2021-08-30 19:13:37,543 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location getNumbers3Err0REQUIRES_VIOLATION (9 of 17 remaining) [2021-08-30 19:13:37,543 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location getNumbers3Err1REQUIRES_VIOLATION (8 of 17 remaining) [2021-08-30 19:13:37,544 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location getNumbers3Err2REQUIRES_VIOLATION (7 of 17 remaining) [2021-08-30 19:13:37,544 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location getNumbers3Err3REQUIRES_VIOLATION (6 of 17 remaining) [2021-08-30 19:13:37,544 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location getNumbers2Err0REQUIRES_VIOLATION (5 of 17 remaining) [2021-08-30 19:13:37,544 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location getNumbers2Err1REQUIRES_VIOLATION (4 of 17 remaining) [2021-08-30 19:13:37,544 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location getNumbers2Err2REQUIRES_VIOLATION (3 of 17 remaining) [2021-08-30 19:13:37,544 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location getNumbers2Err3REQUIRES_VIOLATION (2 of 17 remaining) [2021-08-30 19:13:37,544 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location getNumbersErr0REQUIRES_VIOLATION (1 of 17 remaining) [2021-08-30 19:13:37,545 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location getNumbersErr1REQUIRES_VIOLATION (0 of 17 remaining) [2021-08-30 19:13:37,545 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-08-30 19:13:37,551 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-30 19:13:37,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 07:13:37 BoogieIcfgContainer [2021-08-30 19:13:37,660 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-30 19:13:37,661 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-30 19:13:37,661 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-30 19:13:37,661 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-30 19:13:37,662 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 07:12:36" (3/4) ... [2021-08-30 19:13:37,663 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-08-30 19:13:37,732 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-30 19:13:37,732 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-30 19:13:37,733 INFO L158 Benchmark]: Toolchain (without parser) took 61788.27ms. Allocated memory was 62.9MB in the beginning and 211.8MB in the end (delta: 148.9MB). Free memory was 42.9MB in the beginning and 131.6MB in the end (delta: -88.7MB). Peak memory consumption was 59.5MB. Max. memory is 16.1GB. [2021-08-30 19:13:37,733 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 62.9MB. Free memory was 43.7MB in the beginning and 43.6MB in the end (delta: 31.3kB). There was no memory consumed. Max. memory is 16.1GB. [2021-08-30 19:13:37,733 INFO L158 Benchmark]: CACSL2BoogieTranslator took 245.40ms. Allocated memory is still 62.9MB. Free memory was 42.7MB in the beginning and 32.8MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-08-30 19:13:37,733 INFO L158 Benchmark]: Boogie Preprocessor took 84.36ms. Allocated memory is still 62.9MB. Free memory was 32.8MB in the beginning and 44.9MB in the end (delta: -12.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-08-30 19:13:37,734 INFO L158 Benchmark]: RCFGBuilder took 331.26ms. Allocated memory is still 62.9MB. Free memory was 44.9MB in the beginning and 33.3MB in the end (delta: 11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-08-30 19:13:37,734 INFO L158 Benchmark]: TraceAbstraction took 61047.79ms. Allocated memory was 62.9MB in the beginning and 211.8MB in the end (delta: 148.9MB). Free memory was 32.9MB in the beginning and 138.9MB in the end (delta: -106.0MB). Peak memory consumption was 43.8MB. Max. memory is 16.1GB. [2021-08-30 19:13:37,736 INFO L158 Benchmark]: Witness Printer took 71.08ms. Allocated memory is still 211.8MB. Free memory was 138.9MB in the beginning and 131.6MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-08-30 19:13:37,737 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 62.9MB. Free memory was 43.7MB in the beginning and 43.6MB in the end (delta: 31.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 245.40ms. Allocated memory is still 62.9MB. Free memory was 42.7MB in the beginning and 32.8MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 84.36ms. Allocated memory is still 62.9MB. Free memory was 32.8MB in the beginning and 44.9MB in the end (delta: -12.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 331.26ms. Allocated memory is still 62.9MB. Free memory was 44.9MB in the beginning and 33.3MB in the end (delta: 11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 61047.79ms. Allocated memory was 62.9MB in the beginning and 211.8MB in the end (delta: 148.9MB). Free memory was 32.9MB in the beginning and 138.9MB in the end (delta: -106.0MB). Peak memory consumption was 43.8MB. Max. memory is 16.1GB. * Witness Printer took 71.08ms. Allocated memory is still 211.8MB. Free memory was 138.9MB in the beginning and 131.6MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.00ms ErrorAutomatonConstructionTimeTotal, 0.00ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.00ms ErrorAutomatonConstructionTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 38]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L6] static int array[10]; [L17] static int numbers2[10]; [L36] static int numbers4[10]; VAL [\old(array)=null, \old(array)=null, \old(numbers2)=null, \old(numbers2)=null, \old(numbers4)=null, \old(numbers4)=null, array={13:0}, numbers2={15:0}, numbers4={17:0}] [L45] CALL getNumbers4() VAL [array={13:0}, numbers2={15:0}, numbers4={17:0}] [L35] CALL, EXPR getNumbers3() VAL [array={13:0}, numbers2={15:0}, numbers4={17:0}] [L25] CALL, EXPR getNumbers2() VAL [array={13:0}, numbers2={15:0}, numbers4={17:0}] [L16] CALL, EXPR getNumbers() VAL [array={13:0}, numbers2={15:0}, numbers4={17:0}] [L8] int i = 0; VAL [array={13:0}, i=0, numbers2={15:0}, numbers4={17:0}] [L8] COND TRUE i < 10 VAL [array={13:0}, i=0, numbers2={15:0}, numbers4={17:0}] [L9] array[i] = i VAL [array={13:0}, i=0, numbers2={15:0}, numbers4={17:0}] [L8] ++i VAL [array={13:0}, i=1, numbers2={15:0}, numbers4={17:0}] [L8] COND TRUE i < 10 VAL [array={13:0}, i=1, numbers2={15:0}, numbers4={17:0}] [L9] array[i] = i VAL [array={13:0}, i=1, numbers2={15:0}, numbers4={17:0}] [L8] ++i VAL [array={13:0}, i=2, numbers2={15:0}, numbers4={17:0}] [L8] COND TRUE i < 10 VAL [array={13:0}, i=2, numbers2={15:0}, numbers4={17:0}] [L9] array[i] = i VAL [array={13:0}, i=2, numbers2={15:0}, numbers4={17:0}] [L8] ++i VAL [array={13:0}, i=3, numbers2={15:0}, numbers4={17:0}] [L8] COND TRUE i < 10 VAL [array={13:0}, i=3, numbers2={15:0}, numbers4={17:0}] [L9] array[i] = i VAL [array={13:0}, i=3, numbers2={15:0}, numbers4={17:0}] [L8] ++i VAL [array={13:0}, i=4, numbers2={15:0}, numbers4={17:0}] [L8] COND TRUE i < 10 VAL [array={13:0}, i=4, numbers2={15:0}, numbers4={17:0}] [L9] array[i] = i VAL [array={13:0}, i=4, numbers2={15:0}, numbers4={17:0}] [L8] ++i VAL [array={13:0}, i=5, numbers2={15:0}, numbers4={17:0}] [L8] COND TRUE i < 10 VAL [array={13:0}, i=5, numbers2={15:0}, numbers4={17:0}] [L9] array[i] = i VAL [array={13:0}, i=5, numbers2={15:0}, numbers4={17:0}] [L8] ++i VAL [array={13:0}, i=6, numbers2={15:0}, numbers4={17:0}] [L8] COND TRUE i < 10 VAL [array={13:0}, i=6, numbers2={15:0}, numbers4={17:0}] [L9] array[i] = i VAL [array={13:0}, i=6, numbers2={15:0}, numbers4={17:0}] [L8] ++i VAL [array={13:0}, i=7, numbers2={15:0}, numbers4={17:0}] [L8] COND TRUE i < 10 VAL [array={13:0}, i=7, numbers2={15:0}, numbers4={17:0}] [L9] array[i] = i VAL [array={13:0}, i=7, numbers2={15:0}, numbers4={17:0}] [L8] ++i VAL [array={13:0}, i=8, numbers2={15:0}, numbers4={17:0}] [L8] COND TRUE i < 10 VAL [array={13:0}, i=8, numbers2={15:0}, numbers4={17:0}] [L9] array[i] = i VAL [array={13:0}, i=8, numbers2={15:0}, numbers4={17:0}] [L8] ++i VAL [array={13:0}, i=9, numbers2={15:0}, numbers4={17:0}] [L8] COND TRUE i < 10 VAL [array={13:0}, i=9, numbers2={15:0}, numbers4={17:0}] [L9] array[i] = i VAL [array={13:0}, i=9, numbers2={15:0}, numbers4={17:0}] [L8] ++i VAL [array={13:0}, i=10, numbers2={15:0}, numbers4={17:0}] [L8] COND FALSE !(i < 10) VAL [array={13:0}, i=10, numbers2={15:0}, numbers4={17:0}] [L12] return array; VAL [\result={13:0}, array={13:0}, i=10, numbers2={15:0}, numbers4={17:0}] [L16] RET, EXPR getNumbers() VAL [array={13:0}, getNumbers()={13:0}, numbers2={15:0}, numbers4={17:0}] [L16] int* numbers = getNumbers(); [L18] int i = 0; VAL [array={13:0}, i=0, numbers={13:0}, numbers2={15:0}, numbers4={17:0}] [L18] COND TRUE i < 10 VAL [array={13:0}, i=0, numbers={13:0}, numbers2={15:0}, numbers4={17:0}] [L19] EXPR numbers[i] VAL [array={13:0}, i=0, numbers={13:0}, numbers2={15:0}, numbers4={17:0}, numbers[i]=0] [L19] numbers2[i] = numbers[i] VAL [array={13:0}, i=0, numbers={13:0}, numbers2={15:0}, numbers4={17:0}, numbers[i]=0] [L18] ++i VAL [array={13:0}, i=1, numbers={13:0}, numbers2={15:0}, numbers4={17:0}] [L18] COND TRUE i < 10 VAL [array={13:0}, i=1, numbers={13:0}, numbers2={15:0}, numbers4={17:0}] [L19] EXPR numbers[i] VAL [array={13:0}, i=1, numbers={13:0}, numbers2={15:0}, numbers4={17:0}, numbers[i]=1] [L19] numbers2[i] = numbers[i] VAL [array={13:0}, i=1, numbers={13:0}, numbers2={15:0}, numbers4={17:0}, numbers[i]=1] [L18] ++i VAL [array={13:0}, i=2, numbers={13:0}, numbers2={15:0}, numbers4={17:0}] [L18] COND TRUE i < 10 VAL [array={13:0}, i=2, numbers={13:0}, numbers2={15:0}, numbers4={17:0}] [L19] EXPR numbers[i] VAL [array={13:0}, i=2, numbers={13:0}, numbers2={15:0}, numbers4={17:0}, numbers[i]=2] [L19] numbers2[i] = numbers[i] VAL [array={13:0}, i=2, numbers={13:0}, numbers2={15:0}, numbers4={17:0}, numbers[i]=2] [L18] ++i VAL [array={13:0}, i=3, numbers={13:0}, numbers2={15:0}, numbers4={17:0}] [L18] COND TRUE i < 10 VAL [array={13:0}, i=3, numbers={13:0}, numbers2={15:0}, numbers4={17:0}] [L19] EXPR numbers[i] VAL [array={13:0}, i=3, numbers={13:0}, numbers2={15:0}, numbers4={17:0}, numbers[i]=3] [L19] numbers2[i] = numbers[i] VAL [array={13:0}, i=3, numbers={13:0}, numbers2={15:0}, numbers4={17:0}, numbers[i]=3] [L18] ++i VAL [array={13:0}, i=4, numbers={13:0}, numbers2={15:0}, numbers4={17:0}] [L18] COND TRUE i < 10 VAL [array={13:0}, i=4, numbers={13:0}, numbers2={15:0}, numbers4={17:0}] [L19] EXPR numbers[i] VAL [array={13:0}, i=4, numbers={13:0}, numbers2={15:0}, numbers4={17:0}, numbers[i]=4] [L19] numbers2[i] = numbers[i] VAL [array={13:0}, i=4, numbers={13:0}, numbers2={15:0}, numbers4={17:0}, numbers[i]=4] [L18] ++i VAL [array={13:0}, i=5, numbers={13:0}, numbers2={15:0}, numbers4={17:0}] [L18] COND TRUE i < 10 VAL [array={13:0}, i=5, numbers={13:0}, numbers2={15:0}, numbers4={17:0}] [L19] EXPR numbers[i] VAL [array={13:0}, i=5, numbers={13:0}, numbers2={15:0}, numbers4={17:0}, numbers[i]=5] [L19] numbers2[i] = numbers[i] VAL [array={13:0}, i=5, numbers={13:0}, numbers2={15:0}, numbers4={17:0}, numbers[i]=5] [L18] ++i VAL [array={13:0}, i=6, numbers={13:0}, numbers2={15:0}, numbers4={17:0}] [L18] COND TRUE i < 10 VAL [array={13:0}, i=6, numbers={13:0}, numbers2={15:0}, numbers4={17:0}] [L19] EXPR numbers[i] VAL [array={13:0}, i=6, numbers={13:0}, numbers2={15:0}, numbers4={17:0}, numbers[i]=6] [L19] numbers2[i] = numbers[i] VAL [array={13:0}, i=6, numbers={13:0}, numbers2={15:0}, numbers4={17:0}, numbers[i]=6] [L18] ++i VAL [array={13:0}, i=7, numbers={13:0}, numbers2={15:0}, numbers4={17:0}] [L18] COND TRUE i < 10 VAL [array={13:0}, i=7, numbers={13:0}, numbers2={15:0}, numbers4={17:0}] [L19] EXPR numbers[i] VAL [array={13:0}, i=7, numbers={13:0}, numbers2={15:0}, numbers4={17:0}, numbers[i]=7] [L19] numbers2[i] = numbers[i] VAL [array={13:0}, i=7, numbers={13:0}, numbers2={15:0}, numbers4={17:0}, numbers[i]=7] [L18] ++i VAL [array={13:0}, i=8, numbers={13:0}, numbers2={15:0}, numbers4={17:0}] [L18] COND TRUE i < 10 VAL [array={13:0}, i=8, numbers={13:0}, numbers2={15:0}, numbers4={17:0}] [L19] EXPR numbers[i] VAL [array={13:0}, i=8, numbers={13:0}, numbers2={15:0}, numbers4={17:0}, numbers[i]=8] [L19] numbers2[i] = numbers[i] VAL [array={13:0}, i=8, numbers={13:0}, numbers2={15:0}, numbers4={17:0}, numbers[i]=8] [L18] ++i VAL [array={13:0}, i=9, numbers={13:0}, numbers2={15:0}, numbers4={17:0}] [L18] COND TRUE i < 10 VAL [array={13:0}, i=9, numbers={13:0}, numbers2={15:0}, numbers4={17:0}] [L19] EXPR numbers[i] VAL [array={13:0}, i=9, numbers={13:0}, numbers2={15:0}, numbers4={17:0}, numbers[i]=9] [L19] numbers2[i] = numbers[i] VAL [array={13:0}, i=9, numbers={13:0}, numbers2={15:0}, numbers4={17:0}, numbers[i]=9] [L18] ++i VAL [array={13:0}, i=10, numbers={13:0}, numbers2={15:0}, numbers4={17:0}] [L18] COND FALSE !(i < 10) VAL [array={13:0}, i=10, numbers={13:0}, numbers2={15:0}, numbers4={17:0}] [L21] return numbers2; VAL [\result={15:0}, array={13:0}, i=10, numbers={13:0}, numbers2={15:0}, numbers4={17:0}] [L25] RET, EXPR getNumbers2() VAL [array={13:0}, getNumbers2()={15:0}, numbers2={15:0}, numbers4={17:0}] [L25] int* numbers = getNumbers2(); [L26] int numbers3[10]; [L27] int i = 0; VAL [array={13:0}, i=0, numbers={15:0}, numbers2={15:0}, numbers3={11:0}, numbers4={17:0}] [L27] COND TRUE i < 10 VAL [array={13:0}, i=0, numbers={15:0}, numbers2={15:0}, numbers3={11:0}, numbers4={17:0}] [L28] EXPR numbers[i] VAL [array={13:0}, i=0, numbers={15:0}, numbers2={15:0}, numbers3={11:0}, numbers4={17:0}, numbers[i]=0] [L28] numbers3[i] = numbers[i] VAL [array={13:0}, i=0, numbers={15:0}, numbers2={15:0}, numbers3={11:0}, numbers4={17:0}, numbers[i]=0] [L27] ++i VAL [array={13:0}, i=1, numbers={15:0}, numbers2={15:0}, numbers3={11:0}, numbers4={17:0}] [L27] COND TRUE i < 10 VAL [array={13:0}, i=1, numbers={15:0}, numbers2={15:0}, numbers3={11:0}, numbers4={17:0}] [L28] EXPR numbers[i] VAL [array={13:0}, i=1, numbers={15:0}, numbers2={15:0}, numbers3={11:0}, numbers4={17:0}, numbers[i]=1] [L28] numbers3[i] = numbers[i] VAL [array={13:0}, i=1, numbers={15:0}, numbers2={15:0}, numbers3={11:0}, numbers4={17:0}, numbers[i]=1] [L27] ++i VAL [array={13:0}, i=2, numbers={15:0}, numbers2={15:0}, numbers3={11:0}, numbers4={17:0}] [L27] COND TRUE i < 10 VAL [array={13:0}, i=2, numbers={15:0}, numbers2={15:0}, numbers3={11:0}, numbers4={17:0}] [L28] EXPR numbers[i] VAL [array={13:0}, i=2, numbers={15:0}, numbers2={15:0}, numbers3={11:0}, numbers4={17:0}, numbers[i]=2] [L28] numbers3[i] = numbers[i] VAL [array={13:0}, i=2, numbers={15:0}, numbers2={15:0}, numbers3={11:0}, numbers4={17:0}, numbers[i]=2] [L27] ++i VAL [array={13:0}, i=3, numbers={15:0}, numbers2={15:0}, numbers3={11:0}, numbers4={17:0}] [L27] COND TRUE i < 10 VAL [array={13:0}, i=3, numbers={15:0}, numbers2={15:0}, numbers3={11:0}, numbers4={17:0}] [L28] EXPR numbers[i] VAL [array={13:0}, i=3, numbers={15:0}, numbers2={15:0}, numbers3={11:0}, numbers4={17:0}, numbers[i]=3] [L28] numbers3[i] = numbers[i] VAL [array={13:0}, i=3, numbers={15:0}, numbers2={15:0}, numbers3={11:0}, numbers4={17:0}, numbers[i]=3] [L27] ++i VAL [array={13:0}, i=4, numbers={15:0}, numbers2={15:0}, numbers3={11:0}, numbers4={17:0}] [L27] COND TRUE i < 10 VAL [array={13:0}, i=4, numbers={15:0}, numbers2={15:0}, numbers3={11:0}, numbers4={17:0}] [L28] EXPR numbers[i] VAL [array={13:0}, i=4, numbers={15:0}, numbers2={15:0}, numbers3={11:0}, numbers4={17:0}, numbers[i]=4] [L28] numbers3[i] = numbers[i] VAL [array={13:0}, i=4, numbers={15:0}, numbers2={15:0}, numbers3={11:0}, numbers4={17:0}, numbers[i]=4] [L27] ++i VAL [array={13:0}, i=5, numbers={15:0}, numbers2={15:0}, numbers3={11:0}, numbers4={17:0}] [L27] COND TRUE i < 10 VAL [array={13:0}, i=5, numbers={15:0}, numbers2={15:0}, numbers3={11:0}, numbers4={17:0}] [L28] EXPR numbers[i] VAL [array={13:0}, i=5, numbers={15:0}, numbers2={15:0}, numbers3={11:0}, numbers4={17:0}, numbers[i]=5] [L28] numbers3[i] = numbers[i] VAL [array={13:0}, i=5, numbers={15:0}, numbers2={15:0}, numbers3={11:0}, numbers4={17:0}, numbers[i]=5] [L27] ++i VAL [array={13:0}, i=6, numbers={15:0}, numbers2={15:0}, numbers3={11:0}, numbers4={17:0}] [L27] COND TRUE i < 10 VAL [array={13:0}, i=6, numbers={15:0}, numbers2={15:0}, numbers3={11:0}, numbers4={17:0}] [L28] EXPR numbers[i] VAL [array={13:0}, i=6, numbers={15:0}, numbers2={15:0}, numbers3={11:0}, numbers4={17:0}, numbers[i]=6] [L28] numbers3[i] = numbers[i] VAL [array={13:0}, i=6, numbers={15:0}, numbers2={15:0}, numbers3={11:0}, numbers4={17:0}, numbers[i]=6] [L27] ++i VAL [array={13:0}, i=7, numbers={15:0}, numbers2={15:0}, numbers3={11:0}, numbers4={17:0}] [L27] COND TRUE i < 10 VAL [array={13:0}, i=7, numbers={15:0}, numbers2={15:0}, numbers3={11:0}, numbers4={17:0}] [L28] EXPR numbers[i] VAL [array={13:0}, i=7, numbers={15:0}, numbers2={15:0}, numbers3={11:0}, numbers4={17:0}, numbers[i]=7] [L28] numbers3[i] = numbers[i] VAL [array={13:0}, i=7, numbers={15:0}, numbers2={15:0}, numbers3={11:0}, numbers4={17:0}, numbers[i]=7] [L27] ++i VAL [array={13:0}, i=8, numbers={15:0}, numbers2={15:0}, numbers3={11:0}, numbers4={17:0}] [L27] COND TRUE i < 10 VAL [array={13:0}, i=8, numbers={15:0}, numbers2={15:0}, numbers3={11:0}, numbers4={17:0}] [L28] EXPR numbers[i] VAL [array={13:0}, i=8, numbers={15:0}, numbers2={15:0}, numbers3={11:0}, numbers4={17:0}, numbers[i]=8] [L28] numbers3[i] = numbers[i] VAL [array={13:0}, i=8, numbers={15:0}, numbers2={15:0}, numbers3={11:0}, numbers4={17:0}, numbers[i]=8] [L27] ++i VAL [array={13:0}, i=9, numbers={15:0}, numbers2={15:0}, numbers3={11:0}, numbers4={17:0}] [L27] COND TRUE i < 10 VAL [array={13:0}, i=9, numbers={15:0}, numbers2={15:0}, numbers3={11:0}, numbers4={17:0}] [L28] EXPR numbers[i] VAL [array={13:0}, i=9, numbers={15:0}, numbers2={15:0}, numbers3={11:0}, numbers4={17:0}, numbers[i]=9] [L28] numbers3[i] = numbers[i] VAL [array={13:0}, i=9, numbers={15:0}, numbers2={15:0}, numbers3={11:0}, numbers4={17:0}, numbers[i]=9] [L27] ++i VAL [array={13:0}, i=10, numbers={15:0}, numbers2={15:0}, numbers3={11:0}, numbers4={17:0}] [L27] COND FALSE !(i < 10) VAL [array={13:0}, i=10, numbers={15:0}, numbers2={15:0}, numbers3={11:0}, numbers4={17:0}] [L31] return numbers3; [L31] return numbers3; VAL [\result={11:0}, array={13:0}, i=10, numbers={15:0}, numbers2={15:0}, numbers4={17:0}] [L35] RET, EXPR getNumbers3() VAL [array={13:0}, getNumbers3()={11:0}, numbers2={15:0}, numbers4={17:0}] [L35] int* numbers = getNumbers3(); [L37] int i = 0; VAL [array={13:0}, i=0, numbers={11:0}, numbers2={15:0}, numbers4={17:0}] [L37] COND TRUE i < 10 VAL [array={13:0}, i=0, numbers={11:0}, numbers2={15:0}, numbers4={17:0}] [L38] numbers[i] - UnprovableResult [Line: 38]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 38]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 38]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 43]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 28]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 28]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 28]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 28]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 19]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 19]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 19]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 19]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 9]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 9]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 70 locations, 17 error locations. Started 1 CEGAR loops. OverallTime: 60889.52ms, OverallIterations: 29, TraceHistogramMax: 10, EmptinessCheckTime: 36.27ms, AutomataDifference: 8428.62ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 0.00ms, InitialAbstractionConstructionTime: 9.79ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1355 SdHoareTripleChecker+Valid, 5089.67ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1348 mSDsluCounter, 737 SdHoareTripleChecker+Invalid, 4041.14ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1832 IncrementalHoareTripleChecker+Unchecked, 4998 mSDsCounter, 369 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9641 IncrementalHoareTripleChecker+Invalid, 11842 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 369 mSolverCounterUnsat, 272 mSDtfsCounter, 9641 mSolverCounterSat, 63.62ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3016 GetRequests, 2470 SyntacticMatches, 14 SemanticMatches, 532 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4889 ImplicationChecksByTransitivity, 8578.20ms Time, 0.00ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=178occurred in iteration=27, InterpolantAutomatonStates: 292, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.00ms DumpTime, AutomataMinimizationStatistics: 133.57ms AutomataMinimizationTime, 28 MinimizatonAttempts, 56 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 277.76ms SsaConstructionTime, 1151.20ms SatisfiabilityAnalysisTime, 45715.21ms InterpolantComputationTime, 3599 NumberOfCodeBlocks, 3262 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 4466 ConstructedInterpolants, 487 QuantifiedInterpolants, 35603 SizeOfPredicates, 96 NumberOfNonLiveVariables, 4953 ConjunctsInSsa, 310 ConjunctsInUnsatCore, 61 InterpolantComputations, 14 PerfectInterpolantSequences, 12592/13879 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-08-30 19:13:37,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...