./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/dll-circular-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 20ed64ec 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/forester-heap/dll-circular-2.i -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 d7d859c146e69673ad9c70e998d47ea3e35bbb83 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis 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/forester-heap/dll-circular-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.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 d7d859c146e69673ad9c70e998d47ea3e35bbb83 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-27 06:27:56,210 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 06:27:56,212 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 06:27:56,266 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 06:27:56,267 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 06:27:56,269 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 06:27:56,270 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 06:27:56,279 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 06:27:56,280 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 06:27:56,283 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 06:27:56,284 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 06:27:56,285 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 06:27:56,285 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 06:27:56,293 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 06:27:56,294 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 06:27:56,298 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 06:27:56,299 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 06:27:56,299 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 06:27:56,301 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 06:27:56,305 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 06:27:56,306 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 06:27:56,313 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 06:27:56,315 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 06:27:56,315 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 06:27:56,320 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 06:27:56,320 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 06:27:56,320 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 06:27:56,321 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 06:27:56,321 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 06:27:56,322 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 06:27:56,322 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 06:27:56,323 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 06:27:56,331 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 06:27:56,333 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 06:27:56,333 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 06:27:56,334 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 06:27:56,334 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 06:27:56,334 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 06:27:56,335 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 06:27:56,336 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 06:27:56,336 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 06:27:56,339 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-08-27 06:27:56,377 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 06:27:56,380 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 06:27:56,381 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 06:27:56,381 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 06:27:56,382 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 06:27:56,383 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 06:27:56,383 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 06:27:56,383 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 06:27:56,383 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 06:27:56,383 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 06:27:56,384 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 06:27:56,384 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 06:27:56,384 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 06:27:56,400 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-08-27 06:27:56,401 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-08-27 06:27:56,401 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-08-27 06:27:56,401 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-27 06:27:56,401 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-08-27 06:27:56,401 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 06:27:56,401 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 06:27:56,401 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 06:27:56,402 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 06:27:56,402 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-27 06:27:56,402 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 06:27:56,402 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 06:27:56,402 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-27 06:27:56,402 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 06:27:56,402 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-27 06:27:56,403 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 06:27:56,403 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 -> d7d859c146e69673ad9c70e998d47ea3e35bbb83 [2021-08-27 06:27:56,813 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 06:27:56,825 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 06:27:56,826 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 06:27:56,827 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 06:27:56,827 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 06:27:56,828 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-circular-2.i [2021-08-27 06:27:56,892 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b2435a67/b730607f61c342a3a2575c544bf1dae9/FLAG8e1a13c5a [2021-08-27 06:27:57,497 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 06:27:57,498 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-2.i [2021-08-27 06:27:57,521 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b2435a67/b730607f61c342a3a2575c544bf1dae9/FLAG8e1a13c5a [2021-08-27 06:27:57,763 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b2435a67/b730607f61c342a3a2575c544bf1dae9 [2021-08-27 06:27:57,765 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 06:27:57,766 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-27 06:27:57,767 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 06:27:57,767 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 06:27:57,787 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 06:27:57,787 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 06:27:57" (1/1) ... [2021-08-27 06:27:57,788 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73d5deeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:27:57, skipping insertion in model container [2021-08-27 06:27:57,788 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 06:27:57" (1/1) ... [2021-08-27 06:27:57,792 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 06:27:57,839 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 06:27:58,110 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-2.i[22391,22404] [2021-08-27 06:27:58,114 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-2.i[22497,22510] [2021-08-27 06:27:58,115 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-2.i[22622,22635] [2021-08-27 06:27:58,118 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 06:27:58,136 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 06:27:58,167 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-2.i[22391,22404] [2021-08-27 06:27:58,176 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-2.i[22497,22510] [2021-08-27 06:27:58,181 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-2.i[22622,22635] [2021-08-27 06:27:58,190 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 06:27:58,217 INFO L208 MainTranslator]: Completed translation [2021-08-27 06:27:58,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:27:58 WrapperNode [2021-08-27 06:27:58,218 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 06:27:58,219 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 06:27:58,219 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 06:27:58,219 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 06:27:58,228 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:27:58" (1/1) ... [2021-08-27 06:27:58,228 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:27:58" (1/1) ... [2021-08-27 06:27:58,242 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:27:58" (1/1) ... [2021-08-27 06:27:58,243 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:27:58" (1/1) ... [2021-08-27 06:27:58,261 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:27:58" (1/1) ... [2021-08-27 06:27:58,265 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:27:58" (1/1) ... [2021-08-27 06:27:58,267 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:27:58" (1/1) ... [2021-08-27 06:27:58,271 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 06:27:58,272 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 06:27:58,272 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 06:27:58,272 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 06:27:58,272 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:27:58" (1/1) ... [2021-08-27 06:27:58,277 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 06:27:58,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:27:58,326 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-27 06:27:58,380 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-27 06:27:58,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-08-27 06:27:58,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 06:27:58,406 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-08-27 06:27:58,406 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-08-27 06:27:58,406 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2021-08-27 06:27:58,407 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2021-08-27 06:27:58,407 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2021-08-27 06:27:58,407 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2021-08-27 06:27:58,408 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2021-08-27 06:27:58,408 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2021-08-27 06:27:58,408 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2021-08-27 06:27:58,408 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2021-08-27 06:27:58,408 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2021-08-27 06:27:58,408 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2021-08-27 06:27:58,408 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2021-08-27 06:27:58,408 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2021-08-27 06:27:58,408 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2021-08-27 06:27:58,409 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2021-08-27 06:27:58,409 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2021-08-27 06:27:58,409 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2021-08-27 06:27:58,409 INFO L130 BoogieDeclarations]: Found specification of procedure select [2021-08-27 06:27:58,409 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2021-08-27 06:27:58,409 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2021-08-27 06:27:58,409 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2021-08-27 06:27:58,409 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2021-08-27 06:27:58,410 INFO L130 BoogieDeclarations]: Found specification of procedure random [2021-08-27 06:27:58,410 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2021-08-27 06:27:58,410 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2021-08-27 06:27:58,410 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2021-08-27 06:27:58,410 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2021-08-27 06:27:58,410 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2021-08-27 06:27:58,410 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2021-08-27 06:27:58,410 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2021-08-27 06:27:58,410 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2021-08-27 06:27:58,411 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2021-08-27 06:27:58,411 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2021-08-27 06:27:58,411 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2021-08-27 06:27:58,411 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2021-08-27 06:27:58,411 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2021-08-27 06:27:58,418 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2021-08-27 06:27:58,418 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2021-08-27 06:27:58,419 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2021-08-27 06:27:58,420 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2021-08-27 06:27:58,420 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2021-08-27 06:27:58,420 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2021-08-27 06:27:58,420 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2021-08-27 06:27:58,421 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2021-08-27 06:27:58,421 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2021-08-27 06:27:58,421 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2021-08-27 06:27:58,421 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2021-08-27 06:27:58,421 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2021-08-27 06:27:58,421 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2021-08-27 06:27:58,421 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2021-08-27 06:27:58,421 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2021-08-27 06:27:58,422 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-08-27 06:27:58,422 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-08-27 06:27:58,422 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2021-08-27 06:27:58,422 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-08-27 06:27:58,422 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2021-08-27 06:27:58,422 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2021-08-27 06:27:58,423 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2021-08-27 06:27:58,423 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2021-08-27 06:27:58,423 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2021-08-27 06:27:58,423 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-08-27 06:27:58,424 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2021-08-27 06:27:58,424 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2021-08-27 06:27:58,424 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2021-08-27 06:27:58,424 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2021-08-27 06:27:58,424 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2021-08-27 06:27:58,424 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2021-08-27 06:27:58,425 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2021-08-27 06:27:58,425 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2021-08-27 06:27:58,425 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2021-08-27 06:27:58,425 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2021-08-27 06:27:58,425 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2021-08-27 06:27:58,425 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2021-08-27 06:27:58,425 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2021-08-27 06:27:58,425 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2021-08-27 06:27:58,425 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2021-08-27 06:27:58,426 INFO L130 BoogieDeclarations]: Found specification of procedure system [2021-08-27 06:27:58,426 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2021-08-27 06:27:58,426 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2021-08-27 06:27:58,426 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2021-08-27 06:27:58,426 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2021-08-27 06:27:58,426 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2021-08-27 06:27:58,426 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2021-08-27 06:27:58,426 INFO L130 BoogieDeclarations]: Found specification of procedure div [2021-08-27 06:27:58,426 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2021-08-27 06:27:58,426 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2021-08-27 06:27:58,427 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2021-08-27 06:27:58,427 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2021-08-27 06:27:58,427 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2021-08-27 06:27:58,427 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2021-08-27 06:27:58,427 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2021-08-27 06:27:58,427 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2021-08-27 06:27:58,427 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2021-08-27 06:27:58,427 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2021-08-27 06:27:58,427 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2021-08-27 06:27:58,428 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2021-08-27 06:27:58,428 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2021-08-27 06:27:58,428 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2021-08-27 06:27:58,428 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2021-08-27 06:27:58,428 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2021-08-27 06:27:58,428 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2021-08-27 06:27:58,428 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2021-08-27 06:27:58,428 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2021-08-27 06:27:58,429 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2021-08-27 06:27:58,429 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-08-27 06:27:58,429 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-08-27 06:27:58,429 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-08-27 06:27:58,429 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-08-27 06:27:58,429 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-08-27 06:27:58,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 06:27:58,429 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-08-27 06:27:58,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-08-27 06:27:58,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-27 06:27:58,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-27 06:27:58,430 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-27 06:27:58,430 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-27 06:27:58,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-27 06:27:58,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-08-27 06:27:58,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-27 06:27:58,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 06:27:59,024 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 06:27:59,024 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2021-08-27 06:27:59,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 06:27:59 BoogieIcfgContainer [2021-08-27 06:27:59,025 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 06:27:59,026 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-27 06:27:59,026 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-27 06:27:59,028 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-27 06:27:59,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 06:27:57" (1/3) ... [2021-08-27 06:27:59,029 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5019eec3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 06:27:59, skipping insertion in model container [2021-08-27 06:27:59,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:27:58" (2/3) ... [2021-08-27 06:27:59,029 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5019eec3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 06:27:59, skipping insertion in model container [2021-08-27 06:27:59,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 06:27:59" (3/3) ... [2021-08-27 06:27:59,030 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-circular-2.i [2021-08-27 06:27:59,033 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-27 06:27:59,033 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 52 error locations. [2021-08-27 06:27:59,056 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-27 06:27:59,059 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-27 06:27:59,059 INFO L340 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2021-08-27 06:27:59,068 INFO L276 IsEmpty]: Start isEmpty. Operand has 117 states, 60 states have (on average 2.183333333333333) internal successors, (131), 112 states have internal predecessors, (131), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 06:27:59,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-08-27 06:27:59,072 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:27:59,072 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:27:59,072 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 47 more)] === [2021-08-27 06:27:59,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:27:59,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1390525095, now seen corresponding path program 1 times [2021-08-27 06:27:59,080 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:27:59,080 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192593605] [2021-08-27 06:27:59,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:27:59,081 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:27:59,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:27:59,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:27:59,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:27:59,216 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-27 06:27:59,216 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:27:59,216 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192593605] [2021-08-27 06:27:59,217 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192593605] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:27:59,217 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:27:59,217 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 06:27:59,218 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703380684] [2021-08-27 06:27:59,221 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 06:27:59,221 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:27:59,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 06:27:59,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:27:59,230 INFO L87 Difference]: Start difference. First operand has 117 states, 60 states have (on average 2.183333333333333) internal successors, (131), 112 states have internal predecessors, (131), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:27:59,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:27:59,482 INFO L93 Difference]: Finished difference Result 122 states and 129 transitions. [2021-08-27 06:27:59,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 06:27:59,484 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 7 [2021-08-27 06:27:59,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:27:59,489 INFO L225 Difference]: With dead ends: 122 [2021-08-27 06:27:59,489 INFO L226 Difference]: Without dead ends: 119 [2021-08-27 06:27:59,489 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 26.9ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:27:59,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-08-27 06:27:59,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 109. [2021-08-27 06:27:59,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 59 states have (on average 1.8983050847457628) internal successors, (112), 105 states have internal predecessors, (112), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:27:59,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 115 transitions. [2021-08-27 06:27:59,511 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 115 transitions. Word has length 7 [2021-08-27 06:27:59,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:27:59,511 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 115 transitions. [2021-08-27 06:27:59,511 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:27:59,512 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 115 transitions. [2021-08-27 06:27:59,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-08-27 06:27:59,512 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:27:59,512 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:27:59,512 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-27 06:27:59,512 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr1REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 47 more)] === [2021-08-27 06:27:59,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:27:59,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1390525094, now seen corresponding path program 1 times [2021-08-27 06:27:59,513 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:27:59,513 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268498775] [2021-08-27 06:27:59,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:27:59,514 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:27:59,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:27:59,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:27:59,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:27:59,581 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-27 06:27:59,581 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:27:59,581 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268498775] [2021-08-27 06:27:59,581 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268498775] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:27:59,581 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:27:59,588 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 06:27:59,588 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647558756] [2021-08-27 06:27:59,589 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 06:27:59,589 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:27:59,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 06:27:59,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:27:59,590 INFO L87 Difference]: Start difference. First operand 109 states and 115 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:27:59,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:27:59,822 INFO L93 Difference]: Finished difference Result 116 states and 122 transitions. [2021-08-27 06:27:59,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 06:27:59,823 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 7 [2021-08-27 06:27:59,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:27:59,824 INFO L225 Difference]: With dead ends: 116 [2021-08-27 06:27:59,824 INFO L226 Difference]: Without dead ends: 116 [2021-08-27 06:27:59,825 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 27.1ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:27:59,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-08-27 06:27:59,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 104. [2021-08-27 06:27:59,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 59 states have (on average 1.8135593220338984) internal successors, (107), 100 states have internal predecessors, (107), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:27:59,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 110 transitions. [2021-08-27 06:27:59,830 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 110 transitions. Word has length 7 [2021-08-27 06:27:59,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:27:59,830 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 110 transitions. [2021-08-27 06:27:59,830 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:27:59,830 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 110 transitions. [2021-08-27 06:27:59,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-27 06:27:59,831 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:27:59,831 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:27:59,831 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-27 06:27:59,831 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr19REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 47 more)] === [2021-08-27 06:27:59,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:27:59,832 INFO L82 PathProgramCache]: Analyzing trace with hash 852778048, now seen corresponding path program 1 times [2021-08-27 06:27:59,832 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:27:59,832 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538492111] [2021-08-27 06:27:59,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:27:59,832 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:27:59,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:27:59,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:27:59,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:27:59,921 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-27 06:27:59,921 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:27:59,921 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538492111] [2021-08-27 06:27:59,922 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538492111] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:27:59,922 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:27:59,922 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 06:27:59,922 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111363872] [2021-08-27 06:27:59,923 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 06:27:59,923 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:27:59,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 06:27:59,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 06:27:59,926 INFO L87 Difference]: Start difference. First operand 104 states and 110 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:00,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:28:00,163 INFO L93 Difference]: Finished difference Result 101 states and 108 transitions. [2021-08-27 06:28:00,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 06:28:00,164 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2021-08-27 06:28:00,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:28:00,167 INFO L225 Difference]: With dead ends: 101 [2021-08-27 06:28:00,167 INFO L226 Difference]: Without dead ends: 101 [2021-08-27 06:28:00,167 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 40.2ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-27 06:28:00,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-08-27 06:28:00,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 92. [2021-08-27 06:28:00,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 59 states have (on average 1.6101694915254237) internal successors, (95), 88 states have internal predecessors, (95), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:00,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 98 transitions. [2021-08-27 06:28:00,171 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 98 transitions. Word has length 13 [2021-08-27 06:28:00,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:28:00,172 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 98 transitions. [2021-08-27 06:28:00,172 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:00,172 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 98 transitions. [2021-08-27 06:28:00,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-27 06:28:00,172 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:28:00,172 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:28:00,173 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-27 06:28:00,173 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr20REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 47 more)] === [2021-08-27 06:28:00,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:28:00,173 INFO L82 PathProgramCache]: Analyzing trace with hash 852778049, now seen corresponding path program 1 times [2021-08-27 06:28:00,173 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:28:00,174 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163809034] [2021-08-27 06:28:00,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:28:00,174 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:28:00,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:28:00,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:28:00,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:28:00,256 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-27 06:28:00,256 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:28:00,257 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163809034] [2021-08-27 06:28:00,257 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163809034] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:28:00,257 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:28:00,257 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 06:28:00,257 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648650462] [2021-08-27 06:28:00,258 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 06:28:00,258 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:28:00,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 06:28:00,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 06:28:00,258 INFO L87 Difference]: Start difference. First operand 92 states and 98 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:00,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:28:00,506 INFO L93 Difference]: Finished difference Result 117 states and 124 transitions. [2021-08-27 06:28:00,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 06:28:00,506 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2021-08-27 06:28:00,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:28:00,507 INFO L225 Difference]: With dead ends: 117 [2021-08-27 06:28:00,507 INFO L226 Difference]: Without dead ends: 117 [2021-08-27 06:28:00,507 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 49.5ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-27 06:28:00,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-08-27 06:28:00,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 101. [2021-08-27 06:28:00,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 68 states have (on average 1.5735294117647058) internal successors, (107), 97 states have internal predecessors, (107), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:00,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 110 transitions. [2021-08-27 06:28:00,517 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 110 transitions. Word has length 13 [2021-08-27 06:28:00,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:28:00,517 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 110 transitions. [2021-08-27 06:28:00,518 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:00,518 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2021-08-27 06:28:00,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-08-27 06:28:00,518 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:28:00,518 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:28:00,518 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-27 06:28:00,519 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr10REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 47 more)] === [2021-08-27 06:28:00,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:28:00,519 INFO L82 PathProgramCache]: Analyzing trace with hash 379334724, now seen corresponding path program 1 times [2021-08-27 06:28:00,519 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:28:00,519 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956611546] [2021-08-27 06:28:00,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:28:00,520 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:28:00,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:28:00,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:28:00,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:28:00,593 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-27 06:28:00,593 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:28:00,593 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956611546] [2021-08-27 06:28:00,594 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956611546] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:28:00,594 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:28:00,594 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 06:28:00,594 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701353059] [2021-08-27 06:28:00,594 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 06:28:00,595 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:28:00,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 06:28:00,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-27 06:28:00,595 INFO L87 Difference]: Start difference. First operand 101 states and 110 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:00,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:28:00,817 INFO L93 Difference]: Finished difference Result 100 states and 108 transitions. [2021-08-27 06:28:00,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 06:28:00,818 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2021-08-27 06:28:00,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:28:00,819 INFO L225 Difference]: With dead ends: 100 [2021-08-27 06:28:00,819 INFO L226 Difference]: Without dead ends: 100 [2021-08-27 06:28:00,819 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 50.0ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-08-27 06:28:00,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-08-27 06:28:00,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2021-08-27 06:28:00,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 68 states have (on average 1.5441176470588236) internal successors, (105), 96 states have internal predecessors, (105), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:00,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2021-08-27 06:28:00,822 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 16 [2021-08-27 06:28:00,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:28:00,823 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2021-08-27 06:28:00,823 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:00,823 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2021-08-27 06:28:00,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-08-27 06:28:00,823 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:28:00,823 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:28:00,823 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-27 06:28:00,824 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr11REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 47 more)] === [2021-08-27 06:28:00,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:28:00,824 INFO L82 PathProgramCache]: Analyzing trace with hash 379334725, now seen corresponding path program 1 times [2021-08-27 06:28:00,824 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:28:00,824 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925916009] [2021-08-27 06:28:00,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:28:00,825 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:28:00,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:28:00,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:28:00,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:28:00,905 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-27 06:28:00,905 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:28:00,906 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925916009] [2021-08-27 06:28:00,906 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925916009] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:28:00,906 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:28:00,906 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 06:28:00,906 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085546098] [2021-08-27 06:28:00,906 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 06:28:00,907 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:28:00,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 06:28:00,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-27 06:28:00,907 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:01,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:28:01,125 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2021-08-27 06:28:01,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 06:28:01,125 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2021-08-27 06:28:01,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:28:01,126 INFO L225 Difference]: With dead ends: 99 [2021-08-27 06:28:01,126 INFO L226 Difference]: Without dead ends: 99 [2021-08-27 06:28:01,126 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 60.6ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-08-27 06:28:01,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-08-27 06:28:01,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2021-08-27 06:28:01,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 68 states have (on average 1.5147058823529411) internal successors, (103), 95 states have internal predecessors, (103), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:01,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 106 transitions. [2021-08-27 06:28:01,129 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 106 transitions. Word has length 16 [2021-08-27 06:28:01,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:28:01,130 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 106 transitions. [2021-08-27 06:28:01,130 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:01,130 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 106 transitions. [2021-08-27 06:28:01,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-08-27 06:28:01,130 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:28:01,131 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:28:01,131 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-27 06:28:01,131 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr23ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 47 more)] === [2021-08-27 06:28:01,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:28:01,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1125523357, now seen corresponding path program 1 times [2021-08-27 06:28:01,131 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:28:01,132 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283070904] [2021-08-27 06:28:01,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:28:01,132 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:28:01,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:28:01,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:28:01,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:28:01,329 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-27 06:28:01,330 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:28:01,330 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283070904] [2021-08-27 06:28:01,330 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283070904] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:28:01,330 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:28:01,330 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-27 06:28:01,330 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025078778] [2021-08-27 06:28:01,331 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 06:28:01,331 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:28:01,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 06:28:01,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-08-27 06:28:01,332 INFO L87 Difference]: Start difference. First operand 99 states and 106 transitions. Second operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:01,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:28:01,664 INFO L93 Difference]: Finished difference Result 182 states and 193 transitions. [2021-08-27 06:28:01,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 06:28:01,664 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2021-08-27 06:28:01,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:28:01,665 INFO L225 Difference]: With dead ends: 182 [2021-08-27 06:28:01,665 INFO L226 Difference]: Without dead ends: 182 [2021-08-27 06:28:01,665 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 164.1ms TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2021-08-27 06:28:01,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2021-08-27 06:28:01,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 102. [2021-08-27 06:28:01,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 71 states have (on average 1.4929577464788732) internal successors, (106), 98 states have internal predecessors, (106), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:01,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 109 transitions. [2021-08-27 06:28:01,669 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 109 transitions. Word has length 17 [2021-08-27 06:28:01,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:28:01,670 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 109 transitions. [2021-08-27 06:28:01,670 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:01,670 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2021-08-27 06:28:01,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-08-27 06:28:01,670 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:28:01,670 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:28:01,671 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-27 06:28:01,671 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr24REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 47 more)] === [2021-08-27 06:28:01,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:28:01,671 INFO L82 PathProgramCache]: Analyzing trace with hash -531481519, now seen corresponding path program 1 times [2021-08-27 06:28:01,671 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:28:01,671 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848369534] [2021-08-27 06:28:01,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:28:01,672 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:28:01,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:28:01,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:28:01,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:28:01,864 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-27 06:28:01,864 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:28:01,864 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848369534] [2021-08-27 06:28:01,865 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848369534] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:28:01,865 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:28:01,865 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 06:28:01,865 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543359474] [2021-08-27 06:28:01,865 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 06:28:01,865 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:28:01,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 06:28:01,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-08-27 06:28:01,866 INFO L87 Difference]: Start difference. First operand 102 states and 109 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:02,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:28:02,328 INFO L93 Difference]: Finished difference Result 144 states and 153 transitions. [2021-08-27 06:28:02,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 06:28:02,329 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2021-08-27 06:28:02,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:28:02,330 INFO L225 Difference]: With dead ends: 144 [2021-08-27 06:28:02,330 INFO L226 Difference]: Without dead ends: 144 [2021-08-27 06:28:02,330 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 193.3ms TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2021-08-27 06:28:02,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2021-08-27 06:28:02,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 104. [2021-08-27 06:28:02,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 73 states have (on average 1.4931506849315068) internal successors, (109), 100 states have internal predecessors, (109), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:02,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 112 transitions. [2021-08-27 06:28:02,333 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 112 transitions. Word has length 18 [2021-08-27 06:28:02,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:28:02,334 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 112 transitions. [2021-08-27 06:28:02,334 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:02,334 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 112 transitions. [2021-08-27 06:28:02,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-08-27 06:28:02,334 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:28:02,334 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:28:02,334 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-27 06:28:02,335 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr25REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 47 more)] === [2021-08-27 06:28:02,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:28:02,335 INFO L82 PathProgramCache]: Analyzing trace with hash -531481518, now seen corresponding path program 1 times [2021-08-27 06:28:02,335 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:28:02,335 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870166414] [2021-08-27 06:28:02,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:28:02,336 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:28:02,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:28:02,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:28:02,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:28:02,531 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-27 06:28:02,531 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:28:02,531 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870166414] [2021-08-27 06:28:02,531 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870166414] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:28:02,531 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:28:02,531 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 06:28:02,532 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758737032] [2021-08-27 06:28:02,532 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 06:28:02,532 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:28:02,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 06:28:02,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-08-27 06:28:02,533 INFO L87 Difference]: Start difference. First operand 104 states and 112 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:02,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:28:02,945 INFO L93 Difference]: Finished difference Result 176 states and 187 transitions. [2021-08-27 06:28:02,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 06:28:02,946 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2021-08-27 06:28:02,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:28:02,947 INFO L225 Difference]: With dead ends: 176 [2021-08-27 06:28:02,947 INFO L226 Difference]: Without dead ends: 176 [2021-08-27 06:28:02,947 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 189.5ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-08-27 06:28:02,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2021-08-27 06:28:02,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 116. [2021-08-27 06:28:02,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 85 states have (on average 1.4941176470588236) internal successors, (127), 112 states have internal predecessors, (127), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:02,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 130 transitions. [2021-08-27 06:28:02,950 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 130 transitions. Word has length 18 [2021-08-27 06:28:02,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:28:02,950 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 130 transitions. [2021-08-27 06:28:02,950 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:02,951 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 130 transitions. [2021-08-27 06:28:02,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-27 06:28:02,951 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:28:02,951 INFO L512 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-27 06:28:02,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-27 06:28:02,951 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr14REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 47 more)] === [2021-08-27 06:28:02,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:28:02,952 INFO L82 PathProgramCache]: Analyzing trace with hash 281486598, now seen corresponding path program 1 times [2021-08-27 06:28:02,952 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:28:02,952 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410836356] [2021-08-27 06:28:02,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:28:02,952 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:28:02,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:28:03,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:28:03,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:28:03,077 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-27 06:28:03,077 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:28:03,077 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410836356] [2021-08-27 06:28:03,078 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410836356] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:28:03,078 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:28:03,078 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-27 06:28:03,078 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707002907] [2021-08-27 06:28:03,078 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-27 06:28:03,078 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:28:03,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 06:28:03,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-08-27 06:28:03,079 INFO L87 Difference]: Start difference. First operand 116 states and 130 transitions. Second operand has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:03,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:28:03,458 INFO L93 Difference]: Finished difference Result 124 states and 139 transitions. [2021-08-27 06:28:03,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-27 06:28:03,459 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2021-08-27 06:28:03,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:28:03,459 INFO L225 Difference]: With dead ends: 124 [2021-08-27 06:28:03,460 INFO L226 Difference]: Without dead ends: 124 [2021-08-27 06:28:03,460 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 172.5ms TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2021-08-27 06:28:03,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2021-08-27 06:28:03,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 115. [2021-08-27 06:28:03,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 85 states have (on average 1.4823529411764707) internal successors, (126), 111 states have internal predecessors, (126), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:03,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 129 transitions. [2021-08-27 06:28:03,462 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 129 transitions. Word has length 20 [2021-08-27 06:28:03,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:28:03,463 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 129 transitions. [2021-08-27 06:28:03,463 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:03,463 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 129 transitions. [2021-08-27 06:28:03,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-27 06:28:03,464 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:28:03,464 INFO L512 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-27 06:28:03,464 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-27 06:28:03,464 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr15REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 47 more)] === [2021-08-27 06:28:03,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:28:03,464 INFO L82 PathProgramCache]: Analyzing trace with hash 281486599, now seen corresponding path program 1 times [2021-08-27 06:28:03,465 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:28:03,465 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745425376] [2021-08-27 06:28:03,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:28:03,465 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:28:03,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:28:03,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:28:03,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:28:03,631 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-27 06:28:03,631 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:28:03,631 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745425376] [2021-08-27 06:28:03,631 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745425376] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:28:03,632 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:28:03,632 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-27 06:28:03,632 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566377839] [2021-08-27 06:28:03,632 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-27 06:28:03,632 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:28:03,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-27 06:28:03,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-08-27 06:28:03,633 INFO L87 Difference]: Start difference. First operand 115 states and 129 transitions. Second operand has 11 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:04,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:28:04,246 INFO L93 Difference]: Finished difference Result 119 states and 134 transitions. [2021-08-27 06:28:04,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-08-27 06:28:04,246 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2021-08-27 06:28:04,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:28:04,247 INFO L225 Difference]: With dead ends: 119 [2021-08-27 06:28:04,247 INFO L226 Difference]: Without dead ends: 119 [2021-08-27 06:28:04,248 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 371.2ms TimeCoverageRelationStatistics Valid=142, Invalid=410, Unknown=0, NotChecked=0, Total=552 [2021-08-27 06:28:04,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-08-27 06:28:04,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 103. [2021-08-27 06:28:04,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 79 states have (on average 1.4430379746835442) internal successors, (114), 99 states have internal predecessors, (114), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:04,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 117 transitions. [2021-08-27 06:28:04,250 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 117 transitions. Word has length 20 [2021-08-27 06:28:04,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:28:04,250 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 117 transitions. [2021-08-27 06:28:04,250 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:04,250 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 117 transitions. [2021-08-27 06:28:04,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-27 06:28:04,251 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:28:04,251 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:28:04,251 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-27 06:28:04,251 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr28REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 47 more)] === [2021-08-27 06:28:04,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:28:04,252 INFO L82 PathProgramCache]: Analyzing trace with hash -2116385007, now seen corresponding path program 1 times [2021-08-27 06:28:04,252 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:28:04,252 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020385283] [2021-08-27 06:28:04,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:28:04,252 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:28:04,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:28:04,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:28:04,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:28:04,435 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-27 06:28:04,435 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:28:04,435 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020385283] [2021-08-27 06:28:04,435 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020385283] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:28:04,436 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:28:04,436 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-27 06:28:04,436 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676083991] [2021-08-27 06:28:04,436 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-27 06:28:04,436 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:28:04,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 06:28:04,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-08-27 06:28:04,437 INFO L87 Difference]: Start difference. First operand 103 states and 117 transitions. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:04,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:28:04,902 INFO L93 Difference]: Finished difference Result 151 states and 162 transitions. [2021-08-27 06:28:04,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 06:28:04,903 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2021-08-27 06:28:04,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:28:04,904 INFO L225 Difference]: With dead ends: 151 [2021-08-27 06:28:04,904 INFO L226 Difference]: Without dead ends: 151 [2021-08-27 06:28:04,904 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 267.6ms TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2021-08-27 06:28:04,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2021-08-27 06:28:04,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 103. [2021-08-27 06:28:04,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 79 states have (on average 1.4303797468354431) internal successors, (113), 99 states have internal predecessors, (113), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:04,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2021-08-27 06:28:04,906 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 21 [2021-08-27 06:28:04,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:28:04,907 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2021-08-27 06:28:04,907 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:04,907 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2021-08-27 06:28:04,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-27 06:28:04,907 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:28:04,908 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:28:04,908 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-27 06:28:04,908 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr29REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 47 more)] === [2021-08-27 06:28:04,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:28:04,908 INFO L82 PathProgramCache]: Analyzing trace with hash -2116385006, now seen corresponding path program 1 times [2021-08-27 06:28:04,908 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:28:04,908 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552945318] [2021-08-27 06:28:04,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:28:04,909 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:28:04,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:28:05,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:28:05,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:28:05,120 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-27 06:28:05,120 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:28:05,120 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552945318] [2021-08-27 06:28:05,120 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552945318] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:28:05,120 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:28:05,120 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 06:28:05,121 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6092497] [2021-08-27 06:28:05,121 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 06:28:05,121 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:28:05,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 06:28:05,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-08-27 06:28:05,122 INFO L87 Difference]: Start difference. First operand 103 states and 116 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:05,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:28:05,483 INFO L93 Difference]: Finished difference Result 161 states and 172 transitions. [2021-08-27 06:28:05,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 06:28:05,483 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2021-08-27 06:28:05,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:28:05,484 INFO L225 Difference]: With dead ends: 161 [2021-08-27 06:28:05,484 INFO L226 Difference]: Without dead ends: 161 [2021-08-27 06:28:05,484 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 181.6ms TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2021-08-27 06:28:05,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2021-08-27 06:28:05,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 103. [2021-08-27 06:28:05,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 79 states have (on average 1.4177215189873418) internal successors, (112), 99 states have internal predecessors, (112), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:05,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 115 transitions. [2021-08-27 06:28:05,487 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 115 transitions. Word has length 21 [2021-08-27 06:28:05,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:28:05,487 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 115 transitions. [2021-08-27 06:28:05,487 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:05,487 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 115 transitions. [2021-08-27 06:28:05,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-08-27 06:28:05,488 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:28:05,488 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:28:05,488 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-27 06:28:05,488 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr41REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 47 more)] === [2021-08-27 06:28:05,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:28:05,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1183440567, now seen corresponding path program 1 times [2021-08-27 06:28:05,489 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:28:05,489 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993906860] [2021-08-27 06:28:05,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:28:05,489 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:28:05,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:28:05,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:28:05,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:28:05,563 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-27 06:28:05,563 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:28:05,563 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993906860] [2021-08-27 06:28:05,563 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993906860] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:28:05,563 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:28:05,563 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-27 06:28:05,564 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157390898] [2021-08-27 06:28:05,564 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 06:28:05,564 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:28:05,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 06:28:05,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-08-27 06:28:05,565 INFO L87 Difference]: Start difference. First operand 103 states and 115 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:05,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:28:05,888 INFO L93 Difference]: Finished difference Result 140 states and 155 transitions. [2021-08-27 06:28:05,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 06:28:05,889 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2021-08-27 06:28:05,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:28:05,889 INFO L225 Difference]: With dead ends: 140 [2021-08-27 06:28:05,889 INFO L226 Difference]: Without dead ends: 140 [2021-08-27 06:28:05,890 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 95.4ms TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2021-08-27 06:28:05,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2021-08-27 06:28:05,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 104. [2021-08-27 06:28:05,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 80 states have (on average 1.425) internal successors, (114), 100 states have internal predecessors, (114), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:05,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 117 transitions. [2021-08-27 06:28:05,892 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 117 transitions. Word has length 22 [2021-08-27 06:28:05,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:28:05,892 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 117 transitions. [2021-08-27 06:28:05,892 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:05,892 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 117 transitions. [2021-08-27 06:28:05,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-08-27 06:28:05,893 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:28:05,893 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:28:05,893 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-27 06:28:05,893 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr42REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 47 more)] === [2021-08-27 06:28:05,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:28:05,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1183440566, now seen corresponding path program 1 times [2021-08-27 06:28:05,893 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:28:05,894 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746316349] [2021-08-27 06:28:05,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:28:05,894 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:28:05,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:28:06,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:28:06,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:28:06,090 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-27 06:28:06,090 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:28:06,090 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746316349] [2021-08-27 06:28:06,091 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746316349] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:28:06,091 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:28:06,091 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-27 06:28:06,091 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742206995] [2021-08-27 06:28:06,091 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 06:28:06,091 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:28:06,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 06:28:06,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-08-27 06:28:06,092 INFO L87 Difference]: Start difference. First operand 104 states and 117 transitions. Second operand has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:06,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:28:06,644 INFO L93 Difference]: Finished difference Result 151 states and 163 transitions. [2021-08-27 06:28:06,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-27 06:28:06,645 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2021-08-27 06:28:06,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:28:06,646 INFO L225 Difference]: With dead ends: 151 [2021-08-27 06:28:06,646 INFO L226 Difference]: Without dead ends: 151 [2021-08-27 06:28:06,646 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 312.5ms TimeCoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2021-08-27 06:28:06,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2021-08-27 06:28:06,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 123. [2021-08-27 06:28:06,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 99 states have (on average 1.4848484848484849) internal successors, (147), 119 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:06,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 150 transitions. [2021-08-27 06:28:06,648 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 150 transitions. Word has length 22 [2021-08-27 06:28:06,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:28:06,649 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 150 transitions. [2021-08-27 06:28:06,649 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:06,649 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 150 transitions. [2021-08-27 06:28:06,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-27 06:28:06,649 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:28:06,650 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:28:06,650 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-27 06:28:06,650 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr48ASSERT_VIOLATIONMEMORY_FREE === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 47 more)] === [2021-08-27 06:28:06,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:28:06,650 INFO L82 PathProgramCache]: Analyzing trace with hash 879953592, now seen corresponding path program 1 times [2021-08-27 06:28:06,650 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:28:06,650 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30265165] [2021-08-27 06:28:06,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:28:06,651 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:28:06,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:28:06,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:28:06,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:28:06,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:28:06,932 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:28:06,932 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30265165] [2021-08-27 06:28:06,932 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30265165] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:28:06,932 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:28:06,932 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-27 06:28:06,933 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790943683] [2021-08-27 06:28:06,933 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-27 06:28:06,933 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:28:06,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-27 06:28:06,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2021-08-27 06:28:06,934 INFO L87 Difference]: Start difference. First operand 123 states and 150 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:07,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:28:07,404 INFO L93 Difference]: Finished difference Result 165 states and 176 transitions. [2021-08-27 06:28:07,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-27 06:28:07,404 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2021-08-27 06:28:07,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:28:07,405 INFO L225 Difference]: With dead ends: 165 [2021-08-27 06:28:07,405 INFO L226 Difference]: Without dead ends: 165 [2021-08-27 06:28:07,405 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 315.7ms TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2021-08-27 06:28:07,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2021-08-27 06:28:07,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 124. [2021-08-27 06:28:07,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 100 states have (on average 1.48) internal successors, (148), 120 states have internal predecessors, (148), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:07,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 151 transitions. [2021-08-27 06:28:07,408 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 151 transitions. Word has length 24 [2021-08-27 06:28:07,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:28:07,408 INFO L470 AbstractCegarLoop]: Abstraction has 124 states and 151 transitions. [2021-08-27 06:28:07,409 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:07,409 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 151 transitions. [2021-08-27 06:28:07,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-27 06:28:07,409 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:28:07,409 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:28:07,409 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-27 06:28:07,410 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr49ASSERT_VIOLATIONMEMORY_FREE === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 47 more)] === [2021-08-27 06:28:07,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:28:07,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1508757812, now seen corresponding path program 1 times [2021-08-27 06:28:07,410 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:28:07,410 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297213907] [2021-08-27 06:28:07,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:28:07,411 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:28:07,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:28:07,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:28:07,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:28:07,559 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-27 06:28:07,559 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:28:07,559 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297213907] [2021-08-27 06:28:07,559 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297213907] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:28:07,560 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:28:07,560 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 06:28:07,560 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471226481] [2021-08-27 06:28:07,560 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 06:28:07,560 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:28:07,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 06:28:07,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-08-27 06:28:07,561 INFO L87 Difference]: Start difference. First operand 124 states and 151 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:07,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:28:07,854 INFO L93 Difference]: Finished difference Result 157 states and 171 transitions. [2021-08-27 06:28:07,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 06:28:07,855 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2021-08-27 06:28:07,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:28:07,855 INFO L225 Difference]: With dead ends: 157 [2021-08-27 06:28:07,855 INFO L226 Difference]: Without dead ends: 157 [2021-08-27 06:28:07,856 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 126.2ms TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2021-08-27 06:28:07,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-08-27 06:28:07,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 125. [2021-08-27 06:28:07,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 101 states have (on average 1.4752475247524752) internal successors, (149), 121 states have internal predecessors, (149), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:07,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 152 transitions. [2021-08-27 06:28:07,858 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 152 transitions. Word has length 25 [2021-08-27 06:28:07,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:28:07,859 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 152 transitions. [2021-08-27 06:28:07,859 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:07,859 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 152 transitions. [2021-08-27 06:28:07,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-27 06:28:07,859 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:28:07,859 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:28:07,860 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-27 06:28:07,860 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr36ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 47 more)] === [2021-08-27 06:28:07,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:28:07,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1952446068, now seen corresponding path program 1 times [2021-08-27 06:28:07,860 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:28:07,860 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486295657] [2021-08-27 06:28:07,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:28:07,861 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:28:07,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:28:07,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:28:07,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:28:07,898 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-27 06:28:07,898 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:28:07,898 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486295657] [2021-08-27 06:28:07,899 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486295657] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:28:07,899 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:28:07,899 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 06:28:07,899 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746835214] [2021-08-27 06:28:07,899 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 06:28:07,899 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:28:07,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 06:28:07,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:28:07,900 INFO L87 Difference]: Start difference. First operand 125 states and 152 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:08,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:28:08,007 INFO L93 Difference]: Finished difference Result 128 states and 155 transitions. [2021-08-27 06:28:08,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 06:28:08,007 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2021-08-27 06:28:08,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:28:08,008 INFO L225 Difference]: With dead ends: 128 [2021-08-27 06:28:08,008 INFO L226 Difference]: Without dead ends: 128 [2021-08-27 06:28:08,008 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.8ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:28:08,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2021-08-27 06:28:08,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2021-08-27 06:28:08,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 104 states have (on average 1.4615384615384615) internal successors, (152), 124 states have internal predecessors, (152), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:08,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 155 transitions. [2021-08-27 06:28:08,011 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 155 transitions. Word has length 25 [2021-08-27 06:28:08,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:28:08,011 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 155 transitions. [2021-08-27 06:28:08,011 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:08,011 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 155 transitions. [2021-08-27 06:28:08,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-27 06:28:08,011 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:28:08,012 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:28:08,012 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-27 06:28:08,012 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr18ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 47 more)] === [2021-08-27 06:28:08,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:28:08,012 INFO L82 PathProgramCache]: Analyzing trace with hash -2110605554, now seen corresponding path program 1 times [2021-08-27 06:28:08,012 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:28:08,013 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208513637] [2021-08-27 06:28:08,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:28:08,013 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:28:08,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:28:08,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:28:08,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:28:08,162 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-27 06:28:08,163 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:28:08,163 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208513637] [2021-08-27 06:28:08,163 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208513637] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:28:08,163 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:28:08,163 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-27 06:28:08,163 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826276172] [2021-08-27 06:28:08,164 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 06:28:08,164 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:28:08,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 06:28:08,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-08-27 06:28:08,164 INFO L87 Difference]: Start difference. First operand 128 states and 155 transitions. Second operand has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:08,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:28:08,571 INFO L93 Difference]: Finished difference Result 162 states and 193 transitions. [2021-08-27 06:28:08,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-27 06:28:08,572 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2021-08-27 06:28:08,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:28:08,573 INFO L225 Difference]: With dead ends: 162 [2021-08-27 06:28:08,573 INFO L226 Difference]: Without dead ends: 162 [2021-08-27 06:28:08,573 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 179.9ms TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2021-08-27 06:28:08,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2021-08-27 06:28:08,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 142. [2021-08-27 06:28:08,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 118 states have (on average 1.4322033898305084) internal successors, (169), 138 states have internal predecessors, (169), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:08,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 172 transitions. [2021-08-27 06:28:08,575 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 172 transitions. Word has length 25 [2021-08-27 06:28:08,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:28:08,576 INFO L470 AbstractCegarLoop]: Abstraction has 142 states and 172 transitions. [2021-08-27 06:28:08,576 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:08,576 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 172 transitions. [2021-08-27 06:28:08,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-08-27 06:28:08,576 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:28:08,576 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:28:08,577 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-08-27 06:28:08,577 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr45ASSERT_VIOLATIONMEMORY_FREE === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 47 more)] === [2021-08-27 06:28:08,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:28:08,577 INFO L82 PathProgramCache]: Analyzing trace with hash -473102134, now seen corresponding path program 1 times [2021-08-27 06:28:08,577 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:28:08,577 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374616238] [2021-08-27 06:28:08,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:28:08,578 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:28:08,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:28:08,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:28:08,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:28:08,696 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-27 06:28:08,696 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:28:08,697 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374616238] [2021-08-27 06:28:08,697 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374616238] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:28:08,697 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:28:08,697 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 06:28:08,697 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042745394] [2021-08-27 06:28:08,697 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 06:28:08,697 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:28:08,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 06:28:08,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-08-27 06:28:08,698 INFO L87 Difference]: Start difference. First operand 142 states and 172 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:08,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:28:08,950 INFO L93 Difference]: Finished difference Result 159 states and 177 transitions. [2021-08-27 06:28:08,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 06:28:08,950 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2021-08-27 06:28:08,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:28:08,951 INFO L225 Difference]: With dead ends: 159 [2021-08-27 06:28:08,951 INFO L226 Difference]: Without dead ends: 159 [2021-08-27 06:28:08,951 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 107.7ms TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2021-08-27 06:28:08,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-08-27 06:28:08,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 144. [2021-08-27 06:28:08,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 120 states have (on average 1.425) internal successors, (171), 140 states have internal predecessors, (171), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:08,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 174 transitions. [2021-08-27 06:28:08,954 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 174 transitions. Word has length 26 [2021-08-27 06:28:08,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:28:08,954 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 174 transitions. [2021-08-27 06:28:08,954 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:08,954 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 174 transitions. [2021-08-27 06:28:08,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-08-27 06:28:08,955 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:28:08,955 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:28:08,955 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-08-27 06:28:08,955 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr34REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 47 more)] === [2021-08-27 06:28:08,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:28:08,956 INFO L82 PathProgramCache]: Analyzing trace with hash 396332860, now seen corresponding path program 1 times [2021-08-27 06:28:08,956 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:28:08,956 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531993846] [2021-08-27 06:28:08,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:28:08,956 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:28:08,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:28:09,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:28:09,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:28:09,012 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-27 06:28:09,012 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:28:09,012 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531993846] [2021-08-27 06:28:09,012 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531993846] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:28:09,013 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:28:09,013 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 06:28:09,013 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181731025] [2021-08-27 06:28:09,013 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 06:28:09,013 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:28:09,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 06:28:09,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-27 06:28:09,014 INFO L87 Difference]: Start difference. First operand 144 states and 174 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:09,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:28:09,198 INFO L93 Difference]: Finished difference Result 143 states and 171 transitions. [2021-08-27 06:28:09,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 06:28:09,199 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2021-08-27 06:28:09,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:28:09,200 INFO L225 Difference]: With dead ends: 143 [2021-08-27 06:28:09,200 INFO L226 Difference]: Without dead ends: 143 [2021-08-27 06:28:09,200 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 44.9ms TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-08-27 06:28:09,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-08-27 06:28:09,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2021-08-27 06:28:09,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 120 states have (on average 1.4) internal successors, (168), 139 states have internal predecessors, (168), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:09,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 171 transitions. [2021-08-27 06:28:09,202 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 171 transitions. Word has length 26 [2021-08-27 06:28:09,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:28:09,203 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 171 transitions. [2021-08-27 06:28:09,203 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:09,203 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 171 transitions. [2021-08-27 06:28:09,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-08-27 06:28:09,203 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:28:09,203 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:28:09,203 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-08-27 06:28:09,204 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr35REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 47 more)] === [2021-08-27 06:28:09,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:28:09,204 INFO L82 PathProgramCache]: Analyzing trace with hash 396332861, now seen corresponding path program 1 times [2021-08-27 06:28:09,204 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:28:09,204 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771136299] [2021-08-27 06:28:09,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:28:09,205 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:28:09,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:28:09,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:28:09,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:28:09,444 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-27 06:28:09,444 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:28:09,444 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771136299] [2021-08-27 06:28:09,444 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771136299] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:28:09,444 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:28:09,444 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-27 06:28:09,444 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955403866] [2021-08-27 06:28:09,445 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-27 06:28:09,445 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:28:09,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 06:28:09,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-08-27 06:28:09,445 INFO L87 Difference]: Start difference. First operand 143 states and 171 transitions. Second operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:09,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:28:09,861 INFO L93 Difference]: Finished difference Result 171 states and 185 transitions. [2021-08-27 06:28:09,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 06:28:09,861 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2021-08-27 06:28:09,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:28:09,862 INFO L225 Difference]: With dead ends: 171 [2021-08-27 06:28:09,862 INFO L226 Difference]: Without dead ends: 171 [2021-08-27 06:28:09,863 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 227.2ms TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2021-08-27 06:28:09,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2021-08-27 06:28:09,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 143. [2021-08-27 06:28:09,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 120 states have (on average 1.3916666666666666) internal successors, (167), 139 states have internal predecessors, (167), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:09,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 170 transitions. [2021-08-27 06:28:09,865 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 170 transitions. Word has length 26 [2021-08-27 06:28:09,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:28:09,865 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 170 transitions. [2021-08-27 06:28:09,865 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:09,865 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 170 transitions. [2021-08-27 06:28:09,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-08-27 06:28:09,866 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:28:09,866 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:28:09,866 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-08-27 06:28:09,866 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr51ENSURES_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 47 more)] === [2021-08-27 06:28:09,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:28:09,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1782681097, now seen corresponding path program 1 times [2021-08-27 06:28:09,867 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:28:09,867 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614785490] [2021-08-27 06:28:09,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:28:09,867 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:28:09,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:28:10,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:28:10,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:28:10,076 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-27 06:28:10,076 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:28:10,076 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614785490] [2021-08-27 06:28:10,076 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614785490] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:28:10,077 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:28:10,077 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-27 06:28:10,077 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231879785] [2021-08-27 06:28:10,077 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-27 06:28:10,077 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:28:10,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 06:28:10,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-08-27 06:28:10,078 INFO L87 Difference]: Start difference. First operand 143 states and 170 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:10,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:28:10,484 INFO L93 Difference]: Finished difference Result 160 states and 174 transitions. [2021-08-27 06:28:10,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 06:28:10,484 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2021-08-27 06:28:10,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:28:10,485 INFO L225 Difference]: With dead ends: 160 [2021-08-27 06:28:10,485 INFO L226 Difference]: Without dead ends: 160 [2021-08-27 06:28:10,485 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 260.9ms TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2021-08-27 06:28:10,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-08-27 06:28:10,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 143. [2021-08-27 06:28:10,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 120 states have (on average 1.3833333333333333) internal successors, (166), 139 states have internal predecessors, (166), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:10,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 169 transitions. [2021-08-27 06:28:10,487 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 169 transitions. Word has length 27 [2021-08-27 06:28:10,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:28:10,488 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 169 transitions. [2021-08-27 06:28:10,488 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:10,488 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 169 transitions. [2021-08-27 06:28:10,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-08-27 06:28:10,488 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:28:10,488 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:28:10,489 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-08-27 06:28:10,489 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr24REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 47 more)] === [2021-08-27 06:28:10,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:28:10,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1417209443, now seen corresponding path program 1 times [2021-08-27 06:28:10,489 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:28:10,489 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771629518] [2021-08-27 06:28:10,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:28:10,490 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:28:10,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:28:10,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:28:10,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:28:10,730 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-27 06:28:10,730 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:28:10,730 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771629518] [2021-08-27 06:28:10,730 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771629518] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:28:10,731 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519163395] [2021-08-27 06:28:10,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:28:10,731 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:28:10,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:28:10,732 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-27 06:28:10,733 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-27 06:28:10,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:28:10,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 9 conjunts are in the unsatisfiable core [2021-08-27 06:28:10,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:28:11,075 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2021-08-27 06:28:11,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:28:11,083 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1519163395] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:28:11,084 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-27 06:28:11,084 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2021-08-27 06:28:11,084 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845356802] [2021-08-27 06:28:11,084 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 06:28:11,084 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:28:11,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 06:28:11,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2021-08-27 06:28:11,085 INFO L87 Difference]: Start difference. First operand 143 states and 169 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:11,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:28:11,271 INFO L93 Difference]: Finished difference Result 145 states and 170 transitions. [2021-08-27 06:28:11,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 06:28:11,272 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2021-08-27 06:28:11,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:28:11,273 INFO L225 Difference]: With dead ends: 145 [2021-08-27 06:28:11,273 INFO L226 Difference]: Without dead ends: 145 [2021-08-27 06:28:11,273 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 193.0ms TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2021-08-27 06:28:11,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2021-08-27 06:28:11,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 144. [2021-08-27 06:28:11,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 121 states have (on average 1.3801652892561984) internal successors, (167), 140 states have internal predecessors, (167), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:11,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 170 transitions. [2021-08-27 06:28:11,275 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 170 transitions. Word has length 28 [2021-08-27 06:28:11,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:28:11,276 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 170 transitions. [2021-08-27 06:28:11,276 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:11,276 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 170 transitions. [2021-08-27 06:28:11,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-08-27 06:28:11,276 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:28:11,276 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:28:11,296 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-27 06:28:11,493 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-08-27 06:28:11,493 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr25REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 47 more)] === [2021-08-27 06:28:11,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:28:11,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1417209442, now seen corresponding path program 1 times [2021-08-27 06:28:11,494 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:28:11,494 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432310765] [2021-08-27 06:28:11,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:28:11,494 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:28:11,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:28:11,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:28:11,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:28:11,720 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-27 06:28:11,720 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:28:11,720 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432310765] [2021-08-27 06:28:11,720 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432310765] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:28:11,720 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1341043741] [2021-08-27 06:28:11,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:28:11,720 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:28:11,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:28:11,721 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-27 06:28:11,722 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-27 06:28:11,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:28:11,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 15 conjunts are in the unsatisfiable core [2021-08-27 06:28:11,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:28:12,096 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2021-08-27 06:28:12,100 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2021-08-27 06:28:12,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:28:12,147 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1341043741] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:28:12,147 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-27 06:28:12,147 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2021-08-27 06:28:12,147 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21953545] [2021-08-27 06:28:12,147 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 06:28:12,147 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:28:12,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 06:28:12,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2021-08-27 06:28:12,148 INFO L87 Difference]: Start difference. First operand 144 states and 170 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:12,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:28:12,356 INFO L93 Difference]: Finished difference Result 144 states and 167 transitions. [2021-08-27 06:28:12,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 06:28:12,357 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2021-08-27 06:28:12,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:28:12,357 INFO L225 Difference]: With dead ends: 144 [2021-08-27 06:28:12,357 INFO L226 Difference]: Without dead ends: 144 [2021-08-27 06:28:12,358 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 234.3ms TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2021-08-27 06:28:12,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2021-08-27 06:28:12,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 143. [2021-08-27 06:28:12,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 121 states have (on average 1.3471074380165289) internal successors, (163), 139 states have internal predecessors, (163), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:12,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 166 transitions. [2021-08-27 06:28:12,360 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 166 transitions. Word has length 28 [2021-08-27 06:28:12,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:28:12,360 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 166 transitions. [2021-08-27 06:28:12,360 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:12,360 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 166 transitions. [2021-08-27 06:28:12,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-08-27 06:28:12,361 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:28:12,361 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:28:12,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-08-27 06:28:12,574 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,SelfDestructingSolverStorable24 [2021-08-27 06:28:12,574 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr36ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 47 more)] === [2021-08-27 06:28:12,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:28:12,574 INFO L82 PathProgramCache]: Analyzing trace with hash 287254844, now seen corresponding path program 1 times [2021-08-27 06:28:12,574 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:28:12,575 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161984094] [2021-08-27 06:28:12,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:28:12,575 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:28:12,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:28:12,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:28:12,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:28:12,826 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-27 06:28:12,826 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:28:12,827 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161984094] [2021-08-27 06:28:12,827 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161984094] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:28:12,827 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:28:12,827 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-27 06:28:12,827 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576029123] [2021-08-27 06:28:12,827 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 06:28:12,827 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:28:12,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 06:28:12,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-08-27 06:28:12,829 INFO L87 Difference]: Start difference. First operand 143 states and 166 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:13,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:28:13,319 INFO L93 Difference]: Finished difference Result 155 states and 169 transitions. [2021-08-27 06:28:13,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-27 06:28:13,320 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2021-08-27 06:28:13,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:28:13,320 INFO L225 Difference]: With dead ends: 155 [2021-08-27 06:28:13,321 INFO L226 Difference]: Without dead ends: 155 [2021-08-27 06:28:13,321 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 337.6ms TimeCoverageRelationStatistics Valid=108, Invalid=354, Unknown=0, NotChecked=0, Total=462 [2021-08-27 06:28:13,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-08-27 06:28:13,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 142. [2021-08-27 06:28:13,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 120 states have (on average 1.3416666666666666) internal successors, (161), 138 states have internal predecessors, (161), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:13,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 164 transitions. [2021-08-27 06:28:13,323 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 164 transitions. Word has length 29 [2021-08-27 06:28:13,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:28:13,323 INFO L470 AbstractCegarLoop]: Abstraction has 142 states and 164 transitions. [2021-08-27 06:28:13,323 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:13,324 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 164 transitions. [2021-08-27 06:28:13,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-08-27 06:28:13,324 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:28:13,324 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:28:13,324 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-08-27 06:28:13,324 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr23ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 47 more)] === [2021-08-27 06:28:13,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:28:13,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1071184815, now seen corresponding path program 1 times [2021-08-27 06:28:13,325 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:28:13,325 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205486548] [2021-08-27 06:28:13,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:28:13,325 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:28:13,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:28:13,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:28:13,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:28:13,363 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-27 06:28:13,363 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:28:13,363 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205486548] [2021-08-27 06:28:13,363 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205486548] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:28:13,363 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:28:13,364 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 06:28:13,364 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046967207] [2021-08-27 06:28:13,364 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 06:28:13,364 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:28:13,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 06:28:13,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:28:13,365 INFO L87 Difference]: Start difference. First operand 142 states and 164 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:13,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:28:13,476 INFO L93 Difference]: Finished difference Result 216 states and 241 transitions. [2021-08-27 06:28:13,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 06:28:13,476 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2021-08-27 06:28:13,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:28:13,478 INFO L225 Difference]: With dead ends: 216 [2021-08-27 06:28:13,478 INFO L226 Difference]: Without dead ends: 216 [2021-08-27 06:28:13,478 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.9ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:28:13,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2021-08-27 06:28:13,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 159. [2021-08-27 06:28:13,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 137 states have (on average 1.3065693430656935) internal successors, (179), 155 states have internal predecessors, (179), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:13,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 182 transitions. [2021-08-27 06:28:13,481 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 182 transitions. Word has length 29 [2021-08-27 06:28:13,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:28:13,481 INFO L470 AbstractCegarLoop]: Abstraction has 159 states and 182 transitions. [2021-08-27 06:28:13,481 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:13,482 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 182 transitions. [2021-08-27 06:28:13,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-08-27 06:28:13,482 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:28:13,482 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:28:13,482 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-08-27 06:28:13,482 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting mainErr27REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 47 more)] === [2021-08-27 06:28:13,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:28:13,483 INFO L82 PathProgramCache]: Analyzing trace with hash -433638846, now seen corresponding path program 1 times [2021-08-27 06:28:13,483 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:28:13,483 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715957517] [2021-08-27 06:28:13,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:28:13,483 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:28:13,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:28:13,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:28:13,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:28:13,670 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:28:13,670 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:28:13,670 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715957517] [2021-08-27 06:28:13,670 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715957517] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:28:13,670 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [412653051] [2021-08-27 06:28:13,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:28:13,671 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:28:13,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:28:13,672 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-27 06:28:13,673 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-27 06:28:13,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:28:13,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 19 conjunts are in the unsatisfiable core [2021-08-27 06:28:13,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:28:14,101 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2021-08-27 06:28:14,104 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-08-27 06:28:14,151 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-08-27 06:28:14,174 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:28:14,174 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [412653051] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:28:14,174 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-27 06:28:14,174 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 18 [2021-08-27 06:28:14,175 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003402933] [2021-08-27 06:28:14,175 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 06:28:14,175 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:28:14,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 06:28:14,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2021-08-27 06:28:14,176 INFO L87 Difference]: Start difference. First operand 159 states and 182 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:14,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:28:14,475 INFO L93 Difference]: Finished difference Result 177 states and 201 transitions. [2021-08-27 06:28:14,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 06:28:14,475 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2021-08-27 06:28:14,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:28:14,476 INFO L225 Difference]: With dead ends: 177 [2021-08-27 06:28:14,476 INFO L226 Difference]: Without dead ends: 177 [2021-08-27 06:28:14,476 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 317.2ms TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2021-08-27 06:28:14,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2021-08-27 06:28:14,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 172. [2021-08-27 06:28:14,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 150 states have (on average 1.2933333333333332) internal successors, (194), 168 states have internal predecessors, (194), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:14,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 197 transitions. [2021-08-27 06:28:14,479 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 197 transitions. Word has length 30 [2021-08-27 06:28:14,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:28:14,479 INFO L470 AbstractCegarLoop]: Abstraction has 172 states and 197 transitions. [2021-08-27 06:28:14,479 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:14,479 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 197 transitions. [2021-08-27 06:28:14,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-08-27 06:28:14,479 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:28:14,480 INFO L512 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2021-08-27 06:28:14,498 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-27 06:28:14,696 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:28:14,696 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting mainErr23ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 47 more)] === [2021-08-27 06:28:14,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:28:14,697 INFO L82 PathProgramCache]: Analyzing trace with hash -134989526, now seen corresponding path program 1 times [2021-08-27 06:28:14,697 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:28:14,697 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721494270] [2021-08-27 06:28:14,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:28:14,697 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:28:14,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:28:14,727 ERROR L253 erpolLogProxyWrapper]: Interpolant 14 not inductive [2021-08-27 06:28:14,733 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-08-27 06:28:14,735 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: generated interpolants did not pass sanity check at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:232) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:876) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:392) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:386) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.getInterpolants(ManagedScript.java:191) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:285) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:166) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:327) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:229) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:608) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:53) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:392) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-08-27 06:28:14,740 INFO L168 Benchmark]: Toolchain (without parser) took 16973.47 ms. Allocated memory was 54.5 MB in the beginning and 146.8 MB in the end (delta: 92.3 MB). Free memory was 36.0 MB in the beginning and 107.9 MB in the end (delta: -71.9 MB). Peak memory consumption was 20.2 MB. Max. memory is 16.1 GB. [2021-08-27 06:28:14,741 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 44.0 MB. Free memory was 26.2 MB in the beginning and 26.1 MB in the end (delta: 38.3 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 06:28:14,741 INFO L168 Benchmark]: CACSL2BoogieTranslator took 450.99 ms. Allocated memory is still 54.5 MB. Free memory was 35.8 MB in the beginning and 31.4 MB in the end (delta: 4.4 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-08-27 06:28:14,741 INFO L168 Benchmark]: Boogie Preprocessor took 52.34 ms. Allocated memory is still 54.5 MB. Free memory was 31.2 MB in the beginning and 28.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 06:28:14,742 INFO L168 Benchmark]: RCFGBuilder took 753.90 ms. Allocated memory was 54.5 MB in the beginning and 67.1 MB in the end (delta: 12.6 MB). Free memory was 28.2 MB in the beginning and 40.0 MB in the end (delta: -11.8 MB). Peak memory consumption was 13.5 MB. Max. memory is 16.1 GB. [2021-08-27 06:28:14,742 INFO L168 Benchmark]: TraceAbstraction took 15712.98 ms. Allocated memory was 67.1 MB in the beginning and 146.8 MB in the end (delta: 79.7 MB). Free memory was 39.5 MB in the beginning and 107.9 MB in the end (delta: -68.4 MB). Peak memory consumption was 11.3 MB. Max. memory is 16.1 GB. [2021-08-27 06:28:14,743 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.13 ms. Allocated memory is still 44.0 MB. Free memory was 26.2 MB in the beginning and 26.1 MB in the end (delta: 38.3 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 450.99 ms. Allocated memory is still 54.5 MB. Free memory was 35.8 MB in the beginning and 31.4 MB in the end (delta: 4.4 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 52.34 ms. Allocated memory is still 54.5 MB. Free memory was 31.2 MB in the beginning and 28.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 753.90 ms. Allocated memory was 54.5 MB in the beginning and 67.1 MB in the end (delta: 12.6 MB). Free memory was 28.2 MB in the beginning and 40.0 MB in the end (delta: -11.8 MB). Peak memory consumption was 13.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 15712.98 ms. Allocated memory was 67.1 MB in the beginning and 146.8 MB in the end (delta: 79.7 MB). Free memory was 39.5 MB in the beginning and 107.9 MB in the end (delta: -68.4 MB). Peak memory consumption was 11.3 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: generated interpolants did not pass sanity check de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: generated interpolants did not pass sanity check: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:232) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-08-27 06:28:14,767 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... ### Bit-precise run ### This is Ultimate 0.2.1-dev-20ed64e [2021-08-27 06:28:16,503 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 06:28:16,505 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 06:28:16,538 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 06:28:16,539 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 06:28:16,542 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 06:28:16,543 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 06:28:16,547 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 06:28:16,549 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 06:28:16,552 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 06:28:16,553 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 06:28:16,556 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 06:28:16,556 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 06:28:16,558 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 06:28:16,559 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 06:28:16,561 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 06:28:16,562 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 06:28:16,562 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 06:28:16,564 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 06:28:16,569 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 06:28:16,570 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 06:28:16,570 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 06:28:16,572 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 06:28:16,572 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 06:28:16,574 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 06:28:16,574 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 06:28:16,574 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 06:28:16,575 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 06:28:16,576 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 06:28:16,576 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 06:28:16,576 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 06:28:16,577 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 06:28:16,578 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 06:28:16,579 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 06:28:16,579 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 06:28:16,580 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 06:28:16,580 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 06:28:16,580 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 06:28:16,581 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 06:28:16,582 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 06:28:16,582 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 06:28:16,583 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-08-27 06:28:16,609 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 06:28:16,609 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 06:28:16,610 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 06:28:16,610 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 06:28:16,611 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 06:28:16,611 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 06:28:16,612 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 06:28:16,612 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 06:28:16,612 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 06:28:16,612 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 06:28:16,613 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 06:28:16,613 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 06:28:16,613 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 06:28:16,613 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-08-27 06:28:16,613 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-08-27 06:28:16,613 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-08-27 06:28:16,613 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-27 06:28:16,618 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-08-27 06:28:16,618 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-08-27 06:28:16,618 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-08-27 06:28:16,618 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 06:28:16,618 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 06:28:16,619 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 06:28:16,619 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 06:28:16,619 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-27 06:28:16,619 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 06:28:16,619 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 06:28:16,619 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-27 06:28:16,620 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-08-27 06:28:16,620 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-08-27 06:28:16,620 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 06:28:16,620 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-08-27 06:28:16,620 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> d7d859c146e69673ad9c70e998d47ea3e35bbb83 [2021-08-27 06:28:16,863 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 06:28:16,883 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 06:28:16,885 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 06:28:16,885 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 06:28:16,886 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 06:28:16,886 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-circular-2.i [2021-08-27 06:28:16,928 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e85501199/ad45d0f2b0e74c1ab38313b9cd77eaea/FLAG0cdfec721 [2021-08-27 06:28:17,329 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 06:28:17,329 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-2.i [2021-08-27 06:28:17,336 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e85501199/ad45d0f2b0e74c1ab38313b9cd77eaea/FLAG0cdfec721 [2021-08-27 06:28:17,347 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e85501199/ad45d0f2b0e74c1ab38313b9cd77eaea [2021-08-27 06:28:17,348 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 06:28:17,349 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-27 06:28:17,360 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 06:28:17,360 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 06:28:17,362 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 06:28:17,363 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 06:28:17" (1/1) ... [2021-08-27 06:28:17,363 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2661807a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:28:17, skipping insertion in model container [2021-08-27 06:28:17,363 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 06:28:17" (1/1) ... [2021-08-27 06:28:17,368 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 06:28:17,410 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 06:28:17,548 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-2.i[22391,22404] [2021-08-27 06:28:17,550 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-2.i[22497,22510] [2021-08-27 06:28:17,552 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-2.i[22622,22635] [2021-08-27 06:28:17,554 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 06:28:17,561 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 06:28:17,591 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-2.i[22391,22404] [2021-08-27 06:28:17,592 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-2.i[22497,22510] [2021-08-27 06:28:17,593 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-2.i[22622,22635] [2021-08-27 06:28:17,597 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 06:28:17,616 INFO L208 MainTranslator]: Completed translation [2021-08-27 06:28:17,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:28:17 WrapperNode [2021-08-27 06:28:17,616 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 06:28:17,617 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 06:28:17,617 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 06:28:17,617 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 06:28:17,623 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:28:17" (1/1) ... [2021-08-27 06:28:17,623 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:28:17" (1/1) ... [2021-08-27 06:28:17,633 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:28:17" (1/1) ... [2021-08-27 06:28:17,633 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:28:17" (1/1) ... [2021-08-27 06:28:17,643 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:28:17" (1/1) ... [2021-08-27 06:28:17,646 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:28:17" (1/1) ... [2021-08-27 06:28:17,648 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:28:17" (1/1) ... [2021-08-27 06:28:17,651 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 06:28:17,652 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 06:28:17,652 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 06:28:17,652 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 06:28:17,653 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:28:17" (1/1) ... [2021-08-27 06:28:17,657 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 06:28:17,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:28:17,669 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-27 06:28:17,685 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-27 06:28:17,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-08-27 06:28:17,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 06:28:17,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2021-08-27 06:28:17,698 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-08-27 06:28:17,698 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-08-27 06:28:17,698 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2021-08-27 06:28:17,698 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2021-08-27 06:28:17,699 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2021-08-27 06:28:17,699 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2021-08-27 06:28:17,699 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2021-08-27 06:28:17,699 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2021-08-27 06:28:17,699 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2021-08-27 06:28:17,699 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2021-08-27 06:28:17,700 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2021-08-27 06:28:17,700 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2021-08-27 06:28:17,700 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2021-08-27 06:28:17,700 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2021-08-27 06:28:17,700 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2021-08-27 06:28:17,700 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2021-08-27 06:28:17,700 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2021-08-27 06:28:17,700 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2021-08-27 06:28:17,700 INFO L130 BoogieDeclarations]: Found specification of procedure select [2021-08-27 06:28:17,701 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2021-08-27 06:28:17,701 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2021-08-27 06:28:17,701 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2021-08-27 06:28:17,701 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2021-08-27 06:28:17,701 INFO L130 BoogieDeclarations]: Found specification of procedure random [2021-08-27 06:28:17,701 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2021-08-27 06:28:17,701 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2021-08-27 06:28:17,701 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2021-08-27 06:28:17,701 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2021-08-27 06:28:17,702 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2021-08-27 06:28:17,702 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2021-08-27 06:28:17,702 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2021-08-27 06:28:17,702 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2021-08-27 06:28:17,702 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2021-08-27 06:28:17,702 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2021-08-27 06:28:17,702 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2021-08-27 06:28:17,702 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2021-08-27 06:28:17,702 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2021-08-27 06:28:17,703 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2021-08-27 06:28:17,703 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2021-08-27 06:28:17,703 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2021-08-27 06:28:17,704 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2021-08-27 06:28:17,704 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2021-08-27 06:28:17,704 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2021-08-27 06:28:17,704 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2021-08-27 06:28:17,704 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2021-08-27 06:28:17,704 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2021-08-27 06:28:17,704 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2021-08-27 06:28:17,705 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2021-08-27 06:28:17,705 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2021-08-27 06:28:17,705 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2021-08-27 06:28:17,705 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2021-08-27 06:28:17,705 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2021-08-27 06:28:17,705 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-08-27 06:28:17,705 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-08-27 06:28:17,706 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2021-08-27 06:28:17,706 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-08-27 06:28:17,706 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2021-08-27 06:28:17,706 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2021-08-27 06:28:17,707 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2021-08-27 06:28:17,707 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2021-08-27 06:28:17,707 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2021-08-27 06:28:17,707 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-08-27 06:28:17,707 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2021-08-27 06:28:17,707 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2021-08-27 06:28:17,712 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2021-08-27 06:28:17,712 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2021-08-27 06:28:17,712 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2021-08-27 06:28:17,713 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2021-08-27 06:28:17,713 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2021-08-27 06:28:17,713 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2021-08-27 06:28:17,713 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2021-08-27 06:28:17,713 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2021-08-27 06:28:17,713 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2021-08-27 06:28:17,714 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2021-08-27 06:28:17,714 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2021-08-27 06:28:17,714 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2021-08-27 06:28:17,714 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2021-08-27 06:28:17,714 INFO L130 BoogieDeclarations]: Found specification of procedure system [2021-08-27 06:28:17,714 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2021-08-27 06:28:17,714 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2021-08-27 06:28:17,714 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2021-08-27 06:28:17,714 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2021-08-27 06:28:17,715 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2021-08-27 06:28:17,715 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2021-08-27 06:28:17,715 INFO L130 BoogieDeclarations]: Found specification of procedure div [2021-08-27 06:28:17,715 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2021-08-27 06:28:17,715 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2021-08-27 06:28:17,715 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2021-08-27 06:28:17,715 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2021-08-27 06:28:17,715 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2021-08-27 06:28:17,715 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2021-08-27 06:28:17,715 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2021-08-27 06:28:17,716 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2021-08-27 06:28:17,716 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2021-08-27 06:28:17,716 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2021-08-27 06:28:17,716 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2021-08-27 06:28:17,716 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2021-08-27 06:28:17,716 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2021-08-27 06:28:17,716 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2021-08-27 06:28:17,717 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2021-08-27 06:28:17,717 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2021-08-27 06:28:17,717 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2021-08-27 06:28:17,717 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2021-08-27 06:28:17,717 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2021-08-27 06:28:17,717 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2021-08-27 06:28:17,717 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-08-27 06:28:17,717 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-08-27 06:28:17,717 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-08-27 06:28:17,717 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-08-27 06:28:17,718 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-08-27 06:28:17,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 06:28:17,718 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-08-27 06:28:17,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-08-27 06:28:17,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-27 06:28:17,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-08-27 06:28:17,718 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-27 06:28:17,719 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-08-27 06:28:17,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-27 06:28:17,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-08-27 06:28:17,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-08-27 06:28:17,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 06:28:17,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2021-08-27 06:28:17,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2021-08-27 06:28:17,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-08-27 06:28:18,435 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 06:28:18,435 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2021-08-27 06:28:18,438 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 06:28:18 BoogieIcfgContainer [2021-08-27 06:28:18,442 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 06:28:18,444 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-27 06:28:18,444 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-27 06:28:18,446 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-27 06:28:18,446 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 06:28:17" (1/3) ... [2021-08-27 06:28:18,446 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@724e12f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 06:28:18, skipping insertion in model container [2021-08-27 06:28:18,446 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:28:17" (2/3) ... [2021-08-27 06:28:18,447 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@724e12f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 06:28:18, skipping insertion in model container [2021-08-27 06:28:18,447 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 06:28:18" (3/3) ... [2021-08-27 06:28:18,449 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-circular-2.i [2021-08-27 06:28:18,452 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-27 06:28:18,452 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 52 error locations. [2021-08-27 06:28:18,482 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-27 06:28:18,487 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-27 06:28:18,487 INFO L340 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2021-08-27 06:28:18,498 INFO L276 IsEmpty]: Start isEmpty. Operand has 115 states, 58 states have (on average 2.2241379310344827) internal successors, (129), 110 states have internal predecessors, (129), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 06:28:18,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-08-27 06:28:18,507 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:28:18,508 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:28:18,508 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 47 more)] === [2021-08-27 06:28:18,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:28:18,511 INFO L82 PathProgramCache]: Analyzing trace with hash -169546131, now seen corresponding path program 1 times [2021-08-27 06:28:18,518 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:28:18,518 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2108172148] [2021-08-27 06:28:18,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:28:18,518 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:28:18,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:28:18,520 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:28:18,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-08-27 06:28:18,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:28:18,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 06:28:18,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:28:18,757 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-27 06:28:18,766 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-27 06:28:18,766 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:28:18,802 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-27 06:28:18,803 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:28:18,803 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2108172148] [2021-08-27 06:28:18,803 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2108172148] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:28:18,804 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:28:18,804 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-08-27 06:28:18,805 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54392384] [2021-08-27 06:28:18,807 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 06:28:18,808 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:28:18,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 06:28:18,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 06:28:18,816 INFO L87 Difference]: Start difference. First operand has 115 states, 58 states have (on average 2.2241379310344827) internal successors, (129), 110 states have internal predecessors, (129), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:18,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:28:18,965 INFO L93 Difference]: Finished difference Result 120 states and 127 transitions. [2021-08-27 06:28:18,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 06:28:18,967 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 7 [2021-08-27 06:28:18,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:28:18,971 INFO L225 Difference]: With dead ends: 120 [2021-08-27 06:28:18,971 INFO L226 Difference]: Without dead ends: 117 [2021-08-27 06:28:18,972 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 06:28:18,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-08-27 06:28:18,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 107. [2021-08-27 06:28:18,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 57 states have (on average 1.9298245614035088) internal successors, (110), 103 states have internal predecessors, (110), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:18,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2021-08-27 06:28:18,999 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 7 [2021-08-27 06:28:18,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:28:19,000 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2021-08-27 06:28:19,000 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:19,000 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2021-08-27 06:28:19,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-08-27 06:28:19,000 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:28:19,000 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:28:19,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-08-27 06:28:19,207 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:28:19,208 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr1REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 47 more)] === [2021-08-27 06:28:19,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:28:19,208 INFO L82 PathProgramCache]: Analyzing trace with hash -169546130, now seen corresponding path program 1 times [2021-08-27 06:28:19,210 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:28:19,211 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1100988984] [2021-08-27 06:28:19,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:28:19,211 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:28:19,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:28:19,212 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:28:19,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-08-27 06:28:19,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:28:19,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-27 06:28:19,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:28:19,397 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-27 06:28:19,411 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-27 06:28:19,411 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:28:19,468 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-27 06:28:19,468 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:28:19,468 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1100988984] [2021-08-27 06:28:19,468 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1100988984] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:28:19,468 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:28:19,469 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-08-27 06:28:19,469 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41851002] [2021-08-27 06:28:19,470 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 06:28:19,470 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:28:19,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 06:28:19,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:28:19,470 INFO L87 Difference]: Start difference. First operand 107 states and 113 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:19,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:28:19,652 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2021-08-27 06:28:19,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 06:28:19,653 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 7 [2021-08-27 06:28:19,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:28:19,654 INFO L225 Difference]: With dead ends: 114 [2021-08-27 06:28:19,654 INFO L226 Difference]: Without dead ends: 114 [2021-08-27 06:28:19,654 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.1ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:28:19,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-08-27 06:28:19,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 102. [2021-08-27 06:28:19,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 57 states have (on average 1.8421052631578947) internal successors, (105), 98 states have internal predecessors, (105), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:19,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 108 transitions. [2021-08-27 06:28:19,659 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 108 transitions. Word has length 7 [2021-08-27 06:28:19,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:28:19,660 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 108 transitions. [2021-08-27 06:28:19,660 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:19,660 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 108 transitions. [2021-08-27 06:28:19,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-27 06:28:19,660 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:28:19,660 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:28:19,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-08-27 06:28:19,869 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:28:19,869 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr20REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 47 more)] === [2021-08-27 06:28:19,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:28:19,870 INFO L82 PathProgramCache]: Analyzing trace with hash -196455942, now seen corresponding path program 1 times [2021-08-27 06:28:19,870 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:28:19,870 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [56737631] [2021-08-27 06:28:19,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:28:19,871 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:28:19,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:28:19,872 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:28:19,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-08-27 06:28:20,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:28:20,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-27 06:28:20,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:28:20,105 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-27 06:28:20,196 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-27 06:28:20,196 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:28:20,359 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-27 06:28:20,359 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:28:20,359 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [56737631] [2021-08-27 06:28:20,359 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [56737631] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:28:20,359 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:28:20,359 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2021-08-27 06:28:20,359 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000211553] [2021-08-27 06:28:20,360 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 06:28:20,360 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:28:20,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 06:28:20,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-27 06:28:20,360 INFO L87 Difference]: Start difference. First operand 102 states and 108 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:20,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:28:20,979 INFO L93 Difference]: Finished difference Result 132 states and 139 transitions. [2021-08-27 06:28:20,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 06:28:20,980 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2021-08-27 06:28:20,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:28:20,981 INFO L225 Difference]: With dead ends: 132 [2021-08-27 06:28:20,981 INFO L226 Difference]: Without dead ends: 132 [2021-08-27 06:28:20,981 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 134.5ms TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2021-08-27 06:28:20,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2021-08-27 06:28:20,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 109. [2021-08-27 06:28:20,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 65 states have (on average 1.8307692307692307) internal successors, (119), 105 states have internal predecessors, (119), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:20,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 122 transitions. [2021-08-27 06:28:20,986 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 122 transitions. Word has length 12 [2021-08-27 06:28:20,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:28:20,987 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 122 transitions. [2021-08-27 06:28:20,987 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:20,987 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 122 transitions. [2021-08-27 06:28:20,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-27 06:28:20,987 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:28:20,987 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:28:21,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2021-08-27 06:28:21,195 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:28:21,196 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr19REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 47 more)] === [2021-08-27 06:28:21,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:28:21,196 INFO L82 PathProgramCache]: Analyzing trace with hash -196455943, now seen corresponding path program 1 times [2021-08-27 06:28:21,196 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:28:21,196 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1305540489] [2021-08-27 06:28:21,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:28:21,197 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:28:21,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:28:21,202 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:28:21,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-08-27 06:28:21,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:28:21,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-27 06:28:21,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:28:21,409 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-27 06:28:21,464 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-27 06:28:21,464 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:28:21,538 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-27 06:28:21,539 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:28:21,539 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1305540489] [2021-08-27 06:28:21,539 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1305540489] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:28:21,539 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:28:21,539 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-08-27 06:28:21,539 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704915536] [2021-08-27 06:28:21,539 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 06:28:21,540 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:28:21,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 06:28:21,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:28:21,540 INFO L87 Difference]: Start difference. First operand 109 states and 122 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:21,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:28:21,734 INFO L93 Difference]: Finished difference Result 106 states and 116 transitions. [2021-08-27 06:28:21,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 06:28:21,735 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2021-08-27 06:28:21,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:28:21,736 INFO L225 Difference]: With dead ends: 106 [2021-08-27 06:28:21,736 INFO L226 Difference]: Without dead ends: 106 [2021-08-27 06:28:21,736 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 8 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 36.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 06:28:21,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2021-08-27 06:28:21,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 97. [2021-08-27 06:28:21,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 65 states have (on average 1.5846153846153845) internal successors, (103), 93 states have internal predecessors, (103), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:21,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 106 transitions. [2021-08-27 06:28:21,740 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 106 transitions. Word has length 12 [2021-08-27 06:28:21,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:28:21,741 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 106 transitions. [2021-08-27 06:28:21,741 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:21,741 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 106 transitions. [2021-08-27 06:28:21,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-27 06:28:21,741 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:28:21,741 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:28:21,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-08-27 06:28:21,948 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:28:21,948 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr10REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 47 more)] === [2021-08-27 06:28:21,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:28:21,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1421539775, now seen corresponding path program 1 times [2021-08-27 06:28:21,949 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:28:21,949 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [300555074] [2021-08-27 06:28:21,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:28:21,949 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:28:21,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:28:21,950 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:28:21,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-08-27 06:28:22,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:28:22,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 06:28:22,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:28:22,241 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-27 06:28:22,258 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2021-08-27 06:28:22,283 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-08-27 06:28:22,293 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-27 06:28:22,293 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:28:22,366 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-27 06:28:22,366 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:28:22,366 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [300555074] [2021-08-27 06:28:22,366 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [300555074] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:28:22,366 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:28:22,366 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-08-27 06:28:22,366 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411877537] [2021-08-27 06:28:22,367 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 06:28:22,367 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:28:22,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 06:28:22,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 06:28:22,367 INFO L87 Difference]: Start difference. First operand 97 states and 106 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:22,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:28:22,595 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2021-08-27 06:28:22,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 06:28:22,595 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2021-08-27 06:28:22,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:28:22,596 INFO L225 Difference]: With dead ends: 96 [2021-08-27 06:28:22,596 INFO L226 Difference]: Without dead ends: 96 [2021-08-27 06:28:22,596 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 49.4ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-27 06:28:22,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-08-27 06:28:22,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2021-08-27 06:28:22,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 65 states have (on average 1.5538461538461539) internal successors, (101), 92 states have internal predecessors, (101), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:22,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2021-08-27 06:28:22,599 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 15 [2021-08-27 06:28:22,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:28:22,599 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2021-08-27 06:28:22,599 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:22,599 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2021-08-27 06:28:22,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-27 06:28:22,600 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:28:22,600 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:28:22,606 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2021-08-27 06:28:22,806 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:28:22,806 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr11REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 47 more)] === [2021-08-27 06:28:22,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:28:22,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1421539776, now seen corresponding path program 1 times [2021-08-27 06:28:22,807 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:28:22,807 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1447710256] [2021-08-27 06:28:22,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:28:22,807 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:28:22,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:28:22,809 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:28:22,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-08-27 06:28:23,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:28:23,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 7 conjunts are in the unsatisfiable core [2021-08-27 06:28:23,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:28:23,162 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-27 06:28:23,197 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-08-27 06:28:23,212 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-08-27 06:28:23,265 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-08-27 06:28:23,268 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2021-08-27 06:28:23,305 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-27 06:28:23,306 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:28:23,500 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-27 06:28:23,500 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:28:23,500 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1447710256] [2021-08-27 06:28:23,500 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1447710256] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:28:23,500 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:28:23,500 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2021-08-27 06:28:23,500 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452681242] [2021-08-27 06:28:23,500 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 06:28:23,501 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:28:23,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 06:28:23,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-27 06:28:23,501 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:23,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:28:23,992 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2021-08-27 06:28:23,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 06:28:23,993 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2021-08-27 06:28:23,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:28:23,993 INFO L225 Difference]: With dead ends: 95 [2021-08-27 06:28:23,993 INFO L226 Difference]: Without dead ends: 95 [2021-08-27 06:28:23,994 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 218.5ms TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2021-08-27 06:28:23,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-08-27 06:28:23,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2021-08-27 06:28:23,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 65 states have (on average 1.523076923076923) internal successors, (99), 91 states have internal predecessors, (99), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:23,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2021-08-27 06:28:23,996 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 15 [2021-08-27 06:28:23,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:28:23,996 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2021-08-27 06:28:23,996 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:23,997 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2021-08-27 06:28:23,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-08-27 06:28:23,997 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:28:23,997 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:28:24,007 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-08-27 06:28:24,197 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:28:24,198 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr23ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 47 more)] === [2021-08-27 06:28:24,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:28:24,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1117107868, now seen corresponding path program 1 times [2021-08-27 06:28:24,198 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:28:24,200 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1640084469] [2021-08-27 06:28:24,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:28:24,201 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:28:24,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:28:24,202 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:28:24,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-08-27 06:28:24,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:28:24,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 11 conjunts are in the unsatisfiable core [2021-08-27 06:28:24,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:28:24,485 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-08-27 06:28:24,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:28:24,521 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-08-27 06:28:24,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:28:24,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:28:24,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:28:24,572 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2021-08-27 06:28:24,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:28:24,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:28:24,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:28:24,689 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2021-08-27 06:28:24,725 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-27 06:28:24,725 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 14 [2021-08-27 06:28:24,750 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-27 06:28:24,750 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:28:24,916 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-27 06:28:24,916 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:28:24,917 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1640084469] [2021-08-27 06:28:24,917 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1640084469] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:28:24,917 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:28:24,917 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [] total 11 [2021-08-27 06:28:24,917 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392222356] [2021-08-27 06:28:24,917 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-27 06:28:24,917 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:28:24,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-27 06:28:24,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-08-27 06:28:24,918 INFO L87 Difference]: Start difference. First operand 95 states and 102 transitions. Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:25,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:28:25,425 INFO L93 Difference]: Finished difference Result 177 states and 188 transitions. [2021-08-27 06:28:25,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 06:28:25,425 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2021-08-27 06:28:25,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:28:25,426 INFO L225 Difference]: With dead ends: 177 [2021-08-27 06:28:25,426 INFO L226 Difference]: Without dead ends: 177 [2021-08-27 06:28:25,426 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 237.3ms TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2021-08-27 06:28:25,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2021-08-27 06:28:25,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 99. [2021-08-27 06:28:25,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 69 states have (on average 1.4927536231884058) internal successors, (103), 95 states have internal predecessors, (103), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:25,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 106 transitions. [2021-08-27 06:28:25,429 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 106 transitions. Word has length 16 [2021-08-27 06:28:25,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:28:25,429 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 106 transitions. [2021-08-27 06:28:25,429 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:25,430 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 106 transitions. [2021-08-27 06:28:25,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-08-27 06:28:25,430 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:28:25,430 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:28:25,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-08-27 06:28:25,636 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:28:25,637 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr24REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 47 more)] === [2021-08-27 06:28:25,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:28:25,637 INFO L82 PathProgramCache]: Analyzing trace with hash 270609740, now seen corresponding path program 1 times [2021-08-27 06:28:25,637 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:28:25,637 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1503549963] [2021-08-27 06:28:25,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:28:25,638 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:28:25,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:28:25,638 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:28:25,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-08-27 06:28:25,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:28:25,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 11 conjunts are in the unsatisfiable core [2021-08-27 06:28:25,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:28:25,929 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-27 06:28:25,950 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-08-27 06:28:25,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:28:25,983 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-08-27 06:28:26,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:28:26,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:28:26,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:28:26,027 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2021-08-27 06:28:26,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:28:26,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:28:26,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:28:26,143 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2021-08-27 06:28:26,174 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-27 06:28:26,174 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 21 [2021-08-27 06:28:26,205 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-27 06:28:26,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:28:28,471 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-27 06:28:28,471 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:28:28,471 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1503549963] [2021-08-27 06:28:28,471 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1503549963] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:28:28,471 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:28:28,472 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 10 [2021-08-27 06:28:28,472 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146398997] [2021-08-27 06:28:28,472 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-27 06:28:28,472 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:28:28,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-27 06:28:28,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=75, Unknown=1, NotChecked=0, Total=110 [2021-08-27 06:28:28,473 INFO L87 Difference]: Start difference. First operand 99 states and 106 transitions. Second operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 11 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:31,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:28:31,145 INFO L93 Difference]: Finished difference Result 147 states and 158 transitions. [2021-08-27 06:28:31,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-27 06:28:31,145 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 11 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2021-08-27 06:28:31,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:28:31,146 INFO L225 Difference]: With dead ends: 147 [2021-08-27 06:28:31,146 INFO L226 Difference]: Without dead ends: 147 [2021-08-27 06:28:31,146 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 4104.2ms TimeCoverageRelationStatistics Valid=96, Invalid=175, Unknown=1, NotChecked=0, Total=272 [2021-08-27 06:28:31,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-08-27 06:28:31,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 101. [2021-08-27 06:28:31,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 71 states have (on average 1.4929577464788732) internal successors, (106), 97 states have internal predecessors, (106), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:31,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 109 transitions. [2021-08-27 06:28:31,149 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 109 transitions. Word has length 17 [2021-08-27 06:28:31,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:28:31,149 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 109 transitions. [2021-08-27 06:28:31,149 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 11 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:31,149 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2021-08-27 06:28:31,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-08-27 06:28:31,149 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:28:31,150 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:28:31,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-08-27 06:28:31,361 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:28:31,361 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr25REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 47 more)] === [2021-08-27 06:28:31,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:28:31,361 INFO L82 PathProgramCache]: Analyzing trace with hash 270609741, now seen corresponding path program 1 times [2021-08-27 06:28:31,362 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:28:31,362 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [657364243] [2021-08-27 06:28:31,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:28:31,362 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:28:31,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:28:31,363 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:28:31,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-08-27 06:28:31,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:28:31,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 17 conjunts are in the unsatisfiable core [2021-08-27 06:28:31,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:28:31,684 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-27 06:28:31,709 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-08-27 06:28:31,719 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-08-27 06:28:31,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:28:31,774 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-08-27 06:28:31,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:28:31,786 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-08-27 06:28:31,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:28:31,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:28:31,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:28:31,851 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2021-08-27 06:28:31,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:28:31,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:28:31,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:28:31,871 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2021-08-27 06:28:32,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:28:32,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:28:32,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:28:32,026 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2021-08-27 06:28:32,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:28:32,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:28:32,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:28:32,045 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2021-08-27 06:28:32,077 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-27 06:28:32,078 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 36 [2021-08-27 06:28:32,083 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-27 06:28:32,083 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 15 [2021-08-27 06:28:32,147 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-27 06:28:32,148 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:28:32,958 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-27 06:28:32,959 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:28:32,959 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [657364243] [2021-08-27 06:28:32,959 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [657364243] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:28:32,959 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:28:32,959 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 12 [2021-08-27 06:28:32,959 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549753123] [2021-08-27 06:28:32,960 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-27 06:28:32,960 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:28:32,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-27 06:28:32,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2021-08-27 06:28:32,960 INFO L87 Difference]: Start difference. First operand 101 states and 109 transitions. Second operand has 13 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 13 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:35,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:28:35,302 INFO L93 Difference]: Finished difference Result 172 states and 183 transitions. [2021-08-27 06:28:35,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-27 06:28:35,303 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 13 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2021-08-27 06:28:35,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:28:35,303 INFO L225 Difference]: With dead ends: 172 [2021-08-27 06:28:35,304 INFO L226 Difference]: Without dead ends: 172 [2021-08-27 06:28:35,304 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1373.0ms TimeCoverageRelationStatistics Valid=134, Invalid=286, Unknown=0, NotChecked=0, Total=420 [2021-08-27 06:28:35,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2021-08-27 06:28:35,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 113. [2021-08-27 06:28:35,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 83 states have (on average 1.4939759036144578) internal successors, (124), 109 states have internal predecessors, (124), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:35,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 127 transitions. [2021-08-27 06:28:35,306 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 127 transitions. Word has length 17 [2021-08-27 06:28:35,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:28:35,306 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 127 transitions. [2021-08-27 06:28:35,306 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 13 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:35,306 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 127 transitions. [2021-08-27 06:28:35,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-08-27 06:28:35,307 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:28:35,307 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:28:35,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-08-27 06:28:35,513 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:28:35,513 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr14REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 47 more)] === [2021-08-27 06:28:35,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:28:35,514 INFO L82 PathProgramCache]: Analyzing trace with hash 656971329, now seen corresponding path program 1 times [2021-08-27 06:28:35,514 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:28:35,514 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1375733716] [2021-08-27 06:28:35,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:28:35,514 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:28:35,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:28:35,515 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:28:35,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-08-27 06:28:35,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:28:35,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-27 06:28:35,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:28:35,907 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-27 06:28:35,991 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-08-27 06:28:35,991 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 33 [2021-08-27 06:28:36,054 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2021-08-27 06:28:36,226 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-08-27 06:28:36,228 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 36 [2021-08-27 06:28:36,385 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-08-27 06:28:36,386 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 46 [2021-08-27 06:28:36,588 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-27 06:28:36,588 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:28:37,569 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-27 06:28:37,570 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:28:37,570 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1375733716] [2021-08-27 06:28:37,570 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1375733716] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:28:37,570 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:28:37,570 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 6] imperfect sequences [] total 13 [2021-08-27 06:28:37,570 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313451732] [2021-08-27 06:28:37,571 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-08-27 06:28:37,571 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:28:37,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-27 06:28:37,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2021-08-27 06:28:37,573 INFO L87 Difference]: Start difference. First operand 113 states and 127 transitions. Second operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 14 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:50,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:28:50,519 INFO L93 Difference]: Finished difference Result 121 states and 136 transitions. [2021-08-27 06:28:50,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-27 06:28:50,520 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 14 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2021-08-27 06:28:50,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:28:50,521 INFO L225 Difference]: With dead ends: 121 [2021-08-27 06:28:50,521 INFO L226 Difference]: Without dead ends: 121 [2021-08-27 06:28:50,521 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 21 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1687.1ms TimeCoverageRelationStatistics Valid=171, Invalid=429, Unknown=0, NotChecked=0, Total=600 [2021-08-27 06:28:50,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-08-27 06:28:50,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 112. [2021-08-27 06:28:50,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 83 states have (on average 1.4819277108433735) internal successors, (123), 108 states have internal predecessors, (123), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:50,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 126 transitions. [2021-08-27 06:28:50,523 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 126 transitions. Word has length 19 [2021-08-27 06:28:50,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:28:50,523 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 126 transitions. [2021-08-27 06:28:50,523 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 14 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:28:50,523 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 126 transitions. [2021-08-27 06:28:50,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-08-27 06:28:50,524 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:28:50,524 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:28:50,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-08-27 06:28:50,731 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:28:50,731 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr15REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 47 more)] === [2021-08-27 06:28:50,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:28:50,732 INFO L82 PathProgramCache]: Analyzing trace with hash 656971330, now seen corresponding path program 1 times [2021-08-27 06:28:50,732 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:28:50,732 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [668256261] [2021-08-27 06:28:50,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:28:50,732 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:28:50,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:28:50,733 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:28:50,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-08-27 06:28:51,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:28:51,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2021-08-27 06:28:51,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:28:51,166 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-27 06:28:51,237 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-27 06:28:51,257 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 06:28:51,257 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 18 treesize of output 18 [2021-08-27 06:28:51,302 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-08-27 06:28:51,312 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-08-27 06:28:51,527 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-08-27 06:28:51,527 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 49 [2021-08-27 06:28:51,557 INFO L354 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2021-08-27 06:28:51,557 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 54 [2021-08-27 06:28:51,722 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-08-27 06:28:51,734 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 42 [2021-08-27 06:28:51,743 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-08-27 06:28:51,744 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 19 [2021-08-27 06:28:51,829 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-27 06:28:51,829 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:29:09,522 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-27 06:29:09,527 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-27 06:29:09,729 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-27 06:29:09,729 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:29:09,729 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [668256261] [2021-08-27 06:29:09,729 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [668256261] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:29:09,729 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:29:09,729 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 15 [2021-08-27 06:29:09,729 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776738322] [2021-08-27 06:29:09,730 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-08-27 06:29:09,730 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:29:09,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-08-27 06:29:09,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=195, Unknown=2, NotChecked=0, Total=240 [2021-08-27 06:29:09,731 INFO L87 Difference]: Start difference. First operand 112 states and 126 transitions. Second operand has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:29:22,591 WARN L207 SmtUtils]: Spent 6.14 s on a formula simplification. DAG size of input: 60 DAG size of output: 41 [2021-08-27 06:29:31,607 WARN L207 SmtUtils]: Spent 8.19 s on a formula simplification. DAG size of input: 68 DAG size of output: 51 [2021-08-27 06:29:51,743 WARN L207 SmtUtils]: Spent 6.12 s on a formula simplification. DAG size of input: 67 DAG size of output: 50 [2021-08-27 06:30:00,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:30:00,409 INFO L93 Difference]: Finished difference Result 114 states and 129 transitions. [2021-08-27 06:30:00,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-08-27 06:30:00,410 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2021-08-27 06:30:00,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:30:00,410 INFO L225 Difference]: With dead ends: 114 [2021-08-27 06:30:00,411 INFO L226 Difference]: Without dead ends: 114 [2021-08-27 06:30:00,411 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 15 SyntacticMatches, 8 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 65716.9ms TimeCoverageRelationStatistics Valid=288, Invalid=827, Unknown=7, NotChecked=0, Total=1122 [2021-08-27 06:30:00,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-08-27 06:30:00,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 87. [2021-08-27 06:30:00,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 66 states have (on average 1.393939393939394) internal successors, (92), 83 states have internal predecessors, (92), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:30:00,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2021-08-27 06:30:00,413 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 19 [2021-08-27 06:30:00,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:30:00,413 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2021-08-27 06:30:00,413 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:30:00,413 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2021-08-27 06:30:00,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-27 06:30:00,413 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:30:00,413 INFO L512 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-27 06:30:00,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-08-27 06:30:00,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:30:00,620 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr28REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 47 more)] === [2021-08-27 06:30:00,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:30:00,620 INFO L82 PathProgramCache]: Analyzing trace with hash 81264074, now seen corresponding path program 1 times [2021-08-27 06:30:00,620 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:30:00,620 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1040430589] [2021-08-27 06:30:00,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:30:00,620 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:30:00,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:30:00,621 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:30:00,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-08-27 06:30:01,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:30:01,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 18 conjunts are in the unsatisfiable core [2021-08-27 06:30:01,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:30:01,130 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-27 06:30:01,172 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-08-27 06:30:01,182 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-08-27 06:30:01,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:30:01,239 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-08-27 06:30:01,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:30:01,256 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-08-27 06:30:01,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:30:01,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:30:01,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:30:01,343 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2021-08-27 06:30:01,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:30:01,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:30:01,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:30:01,367 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2021-08-27 06:30:01,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:30:01,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:30:01,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:30:01,572 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2021-08-27 06:30:01,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:30:01,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:30:01,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:30:01,597 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2021-08-27 06:30:01,640 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-27 06:30:01,641 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 42 [2021-08-27 06:30:01,922 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-08-27 06:30:01,923 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 27 [2021-08-27 06:30:01,953 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-27 06:30:01,953 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:30:09,449 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 06:30:09,449 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 1662 treesize of output 1587 [2021-08-27 06:30:09,476 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 4519 treesize of output 4481 [2021-08-27 06:30:09,685 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 960 treesize of output 900 [2021-08-27 06:30:09,850 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-27 06:30:09,850 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:30:09,850 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1040430589] [2021-08-27 06:30:09,850 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1040430589] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:30:09,850 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:30:09,850 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 9] imperfect sequences [] total 15 [2021-08-27 06:30:09,851 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859056689] [2021-08-27 06:30:09,851 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-08-27 06:30:09,851 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:30:09,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-08-27 06:30:09,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=184, Unknown=3, NotChecked=0, Total=240 [2021-08-27 06:30:09,852 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand has 16 states, 15 states have (on average 2.066666666666667) internal successors, (31), 16 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:30:14,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:30:14,674 INFO L93 Difference]: Finished difference Result 149 states and 162 transitions. [2021-08-27 06:30:14,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-27 06:30:14,676 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.066666666666667) internal successors, (31), 16 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2021-08-27 06:30:14,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:30:14,677 INFO L225 Difference]: With dead ends: 149 [2021-08-27 06:30:14,677 INFO L226 Difference]: Without dead ends: 149 [2021-08-27 06:30:14,677 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 10241.6ms TimeCoverageRelationStatistics Valid=137, Invalid=366, Unknown=3, NotChecked=0, Total=506 [2021-08-27 06:30:14,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2021-08-27 06:30:14,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 88. [2021-08-27 06:30:14,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 67 states have (on average 1.4029850746268657) internal successors, (94), 84 states have internal predecessors, (94), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:30:14,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2021-08-27 06:30:14,679 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 20 [2021-08-27 06:30:14,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:30:14,679 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2021-08-27 06:30:14,679 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.066666666666667) internal successors, (31), 16 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:30:14,679 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2021-08-27 06:30:14,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-27 06:30:14,680 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:30:14,680 INFO L512 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-27 06:30:14,688 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-08-27 06:30:14,887 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:30:14,887 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr29REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 47 more)] === [2021-08-27 06:30:14,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:30:14,888 INFO L82 PathProgramCache]: Analyzing trace with hash 81264075, now seen corresponding path program 1 times [2021-08-27 06:30:14,888 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:30:14,888 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [563382145] [2021-08-27 06:30:14,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:30:14,888 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:30:14,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:30:14,889 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:30:14,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-08-27 06:30:15,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:30:15,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 19 conjunts are in the unsatisfiable core [2021-08-27 06:30:15,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:30:15,427 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-27 06:30:15,466 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-08-27 06:30:15,477 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-08-27 06:30:15,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:30:15,531 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-08-27 06:30:15,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:30:15,554 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-08-27 06:30:15,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:30:15,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:30:15,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:30:15,641 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2021-08-27 06:30:15,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:30:15,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:30:15,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:30:15,663 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2021-08-27 06:30:15,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:30:15,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:30:15,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:30:15,892 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2021-08-27 06:30:15,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:30:15,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:30:15,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:30:15,934 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2021-08-27 06:30:16,321 INFO L354 Elim1Store]: treesize reduction 30, result has 9.1 percent of original size [2021-08-27 06:30:16,321 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 46 [2021-08-27 06:30:16,336 INFO L354 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2021-08-27 06:30:16,337 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 21 [2021-08-27 06:30:16,366 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-27 06:30:16,367 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:30:19,990 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:30:19,990 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [563382145] [2021-08-27 06:30:19,991 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Alternating quantifiers not yet supported [2021-08-27 06:30:19,991 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [997853627] [2021-08-27 06:30:19,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:30:19,991 INFO L170 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-08-27 06:30:19,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-08-27 06:30:19,993 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-08-27 06:30:20,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2021-08-27 06:30:20,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:30:20,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 20 conjunts are in the unsatisfiable core [2021-08-27 06:30:20,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:30:20,688 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-27 06:30:20,707 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-08-27 06:30:20,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:30:20,835 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-08-27 06:30:20,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:30:20,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:30:20,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:30:20,971 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2021-08-27 06:30:21,170 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2021-08-27 06:30:21,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:30:21,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:30:21,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:30:21,217 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2021-08-27 06:30:21,908 INFO L354 Elim1Store]: treesize reduction 30, result has 9.1 percent of original size [2021-08-27 06:30:21,908 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 108 treesize of output 82 [2021-08-27 06:30:21,925 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-08-27 06:30:21,925 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 41 [2021-08-27 06:30:21,993 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-27 06:30:21,993 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:30:25,655 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-27 06:30:25,656 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 786 treesize of output 680 [2021-08-27 06:31:44,457 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 68 [2021-08-27 06:31:44,706 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-27 06:31:44,706 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [997853627] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:31:44,706 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:31:44,706 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 17 [2021-08-27 06:31:44,706 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555842974] [2021-08-27 06:31:44,707 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-08-27 06:31:44,707 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:31:44,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-08-27 06:31:44,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=625, Unknown=2, NotChecked=0, Total=756 [2021-08-27 06:31:44,708 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand has 18 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 18 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:31:54,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:31:54,894 INFO L93 Difference]: Finished difference Result 152 states and 163 transitions. [2021-08-27 06:31:54,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-08-27 06:31:54,895 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 18 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2021-08-27 06:31:54,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:31:54,895 INFO L225 Difference]: With dead ends: 152 [2021-08-27 06:31:54,896 INFO L226 Difference]: Without dead ends: 152 [2021-08-27 06:31:54,896 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 17018.6ms TimeCoverageRelationStatistics Valid=285, Invalid=1273, Unknown=2, NotChecked=0, Total=1560 [2021-08-27 06:31:54,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2021-08-27 06:31:54,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 88. [2021-08-27 06:31:54,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 67 states have (on average 1.3880597014925373) internal successors, (93), 84 states have internal predecessors, (93), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:31:54,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2021-08-27 06:31:54,898 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 20 [2021-08-27 06:31:54,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:31:54,898 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2021-08-27 06:31:54,898 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 18 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:31:54,898 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2021-08-27 06:31:54,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-27 06:31:54,898 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:31:54,898 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:31:54,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Forceful destruction successful, exit code 0 [2021-08-27 06:31:55,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-08-27 06:31:55,306 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:31:55,307 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr41REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 47 more)] === [2021-08-27 06:31:55,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:31:55,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1775795772, now seen corresponding path program 1 times [2021-08-27 06:31:55,307 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:31:55,308 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1784078128] [2021-08-27 06:31:55,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:31:55,308 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:31:55,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:31:55,334 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:31:55,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-08-27 06:31:55,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:31:55,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-27 06:31:55,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:31:56,112 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-08-27 06:31:56,159 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-27 06:31:56,159 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:31:56,204 INFO L354 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2021-08-27 06:31:56,204 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 26 treesize of output 25 [2021-08-27 06:31:56,272 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-27 06:31:56,273 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:31:56,273 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1784078128] [2021-08-27 06:31:56,273 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1784078128] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:31:56,273 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:31:56,273 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2021-08-27 06:31:56,273 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509074756] [2021-08-27 06:31:56,274 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 06:31:56,274 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:31:56,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 06:31:56,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-27 06:31:56,275 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:31:57,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:31:57,070 INFO L93 Difference]: Finished difference Result 122 states and 133 transitions. [2021-08-27 06:31:57,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 06:31:57,071 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2021-08-27 06:31:57,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:31:57,071 INFO L225 Difference]: With dead ends: 122 [2021-08-27 06:31:57,071 INFO L226 Difference]: Without dead ends: 122 [2021-08-27 06:31:57,071 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 179.1ms TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-08-27 06:31:57,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2021-08-27 06:31:57,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 89. [2021-08-27 06:31:57,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 68 states have (on average 1.3970588235294117) internal successors, (95), 85 states have internal predecessors, (95), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:31:57,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 98 transitions. [2021-08-27 06:31:57,073 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 98 transitions. Word has length 21 [2021-08-27 06:31:57,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:31:57,073 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 98 transitions. [2021-08-27 06:31:57,073 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:31:57,073 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2021-08-27 06:31:57,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-27 06:31:57,074 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:31:57,074 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:31:57,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-08-27 06:31:57,274 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:31:57,274 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr42REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 47 more)] === [2021-08-27 06:31:57,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:31:57,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1775795771, now seen corresponding path program 1 times [2021-08-27 06:31:57,275 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:31:57,275 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1374403587] [2021-08-27 06:31:57,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:31:57,275 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:31:57,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:31:57,276 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:31:57,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-08-27 06:31:57,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:31:57,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 11 conjunts are in the unsatisfiable core [2021-08-27 06:31:57,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:31:58,185 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2021-08-27 06:31:58,189 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2021-08-27 06:31:58,311 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-27 06:31:58,311 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:31:58,414 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-27 06:31:58,414 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 40 treesize of output 44 [2021-08-27 06:31:58,959 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-27 06:31:58,959 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:31:58,959 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1374403587] [2021-08-27 06:31:58,959 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1374403587] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:31:58,959 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:31:58,960 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 8 [2021-08-27 06:31:58,960 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148398235] [2021-08-27 06:31:58,960 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 06:31:58,960 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:31:58,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 06:31:58,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-08-27 06:31:58,961 INFO L87 Difference]: Start difference. First operand 89 states and 98 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:32:00,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:32:00,708 INFO L93 Difference]: Finished difference Result 123 states and 133 transitions. [2021-08-27 06:32:00,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 06:32:00,710 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2021-08-27 06:32:00,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:32:00,711 INFO L225 Difference]: With dead ends: 123 [2021-08-27 06:32:00,711 INFO L226 Difference]: Without dead ends: 123 [2021-08-27 06:32:00,711 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 837.0ms TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2021-08-27 06:32:00,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2021-08-27 06:32:00,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 89. [2021-08-27 06:32:00,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 68 states have (on average 1.3823529411764706) internal successors, (94), 85 states have internal predecessors, (94), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:32:00,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2021-08-27 06:32:00,712 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 21 [2021-08-27 06:32:00,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:32:00,713 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2021-08-27 06:32:00,713 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:32:00,713 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2021-08-27 06:32:00,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-08-27 06:32:00,713 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:32:00,713 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:32:00,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-08-27 06:32:00,913 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:32:00,914 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr44REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 47 more)] === [2021-08-27 06:32:00,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:32:00,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1437714650, now seen corresponding path program 1 times [2021-08-27 06:32:00,914 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:32:00,914 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1408578260] [2021-08-27 06:32:00,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:32:00,915 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:32:00,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:32:00,916 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:32:00,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-08-27 06:32:01,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:32:01,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 12 conjunts are in the unsatisfiable core [2021-08-27 06:32:01,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:32:01,785 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2021-08-27 06:32:01,789 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-08-27 06:32:01,859 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-08-27 06:32:01,891 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-27 06:32:01,891 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:32:02,007 INFO L354 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2021-08-27 06:32:02,007 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 23 [2021-08-27 06:32:02,103 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-27 06:32:02,104 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:32:02,104 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1408578260] [2021-08-27 06:32:02,104 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1408578260] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:32:02,104 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:32:02,104 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 10 [2021-08-27 06:32:02,104 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344811995] [2021-08-27 06:32:02,105 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-27 06:32:02,105 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:32:02,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 06:32:02,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-08-27 06:32:02,105 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:32:03,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:32:03,142 INFO L93 Difference]: Finished difference Result 123 states and 132 transitions. [2021-08-27 06:32:03,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 06:32:03,143 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2021-08-27 06:32:03,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:32:03,143 INFO L225 Difference]: With dead ends: 123 [2021-08-27 06:32:03,143 INFO L226 Difference]: Without dead ends: 123 [2021-08-27 06:32:03,143 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 370.0ms TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2021-08-27 06:32:03,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2021-08-27 06:32:03,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 95. [2021-08-27 06:32:03,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 74 states have (on average 1.3918918918918919) internal successors, (103), 91 states have internal predecessors, (103), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:32:03,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 106 transitions. [2021-08-27 06:32:03,145 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 106 transitions. Word has length 23 [2021-08-27 06:32:03,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:32:03,145 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 106 transitions. [2021-08-27 06:32:03,145 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:32:03,145 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 106 transitions. [2021-08-27 06:32:03,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-08-27 06:32:03,146 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:32:03,146 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:32:03,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-08-27 06:32:03,346 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:32:03,346 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr48ASSERT_VIOLATIONMEMORY_FREE === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 47 more)] === [2021-08-27 06:32:03,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:32:03,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1437714701, now seen corresponding path program 1 times [2021-08-27 06:32:03,347 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:32:03,347 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1090175489] [2021-08-27 06:32:03,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:32:03,347 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:32:03,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:32:03,348 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:32:03,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-08-27 06:32:04,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:32:04,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 19 conjunts are in the unsatisfiable core [2021-08-27 06:32:04,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:32:04,133 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-08-27 06:32:04,141 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-08-27 06:32:04,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:32:04,179 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-08-27 06:32:04,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:32:04,193 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-08-27 06:32:04,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:32:04,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:32:04,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:32:04,259 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-27 06:32:04,259 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 23 [2021-08-27 06:32:04,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:32:04,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:32:04,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:32:04,278 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2021-08-27 06:32:04,461 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-27 06:32:04,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:32:04,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:32:04,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:32:04,476 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2021-08-27 06:32:04,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:32:04,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:32:04,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:32:04,497 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2021-08-27 06:32:04,576 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-27 06:32:04,577 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 38 [2021-08-27 06:32:04,582 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-27 06:32:04,583 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 17 [2021-08-27 06:32:04,686 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-08-27 06:32:04,729 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-27 06:32:04,729 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:32:04,925 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 91 [2021-08-27 06:32:05,265 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:32:05,266 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1090175489] [2021-08-27 06:32:05,266 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Alternating quantifiers not yet supported [2021-08-27 06:32:05,266 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1023931574] [2021-08-27 06:32:05,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:32:05,266 INFO L170 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-08-27 06:32:05,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-08-27 06:32:05,267 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-08-27 06:32:05,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2021-08-27 06:32:06,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:32:06,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-27 06:32:06,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:32:06,235 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-08-27 06:32:06,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:32:06,308 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-08-27 06:32:06,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:32:06,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:32:06,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:32:06,412 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-27 06:32:06,413 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 23 [2021-08-27 06:32:06,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:32:06,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:32:06,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:32:06,609 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-27 06:32:06,609 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 23 [2021-08-27 06:32:06,757 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-27 06:32:06,757 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2021-08-27 06:32:06,855 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-27 06:32:06,856 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:32:07,302 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-27 06:32:07,303 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1023931574] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:32:07,303 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:32:07,303 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 9 [2021-08-27 06:32:07,303 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267758138] [2021-08-27 06:32:07,303 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-27 06:32:07,303 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:32:07,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 06:32:07,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2021-08-27 06:32:07,304 INFO L87 Difference]: Start difference. First operand 95 states and 106 transitions. Second operand has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 10 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:32:07,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:32:07,986 INFO L93 Difference]: Finished difference Result 143 states and 156 transitions. [2021-08-27 06:32:07,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 06:32:07,987 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 10 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2021-08-27 06:32:07,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:32:07,988 INFO L225 Difference]: With dead ends: 143 [2021-08-27 06:32:07,988 INFO L226 Difference]: Without dead ends: 143 [2021-08-27 06:32:07,988 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 57 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 1275.2ms TimeCoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2021-08-27 06:32:07,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-08-27 06:32:07,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 121. [2021-08-27 06:32:07,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 100 states have (on average 1.41) internal successors, (141), 117 states have internal predecessors, (141), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:32:07,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 144 transitions. [2021-08-27 06:32:07,990 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 144 transitions. Word has length 23 [2021-08-27 06:32:07,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:32:07,990 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 144 transitions. [2021-08-27 06:32:07,990 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 10 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:32:07,990 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 144 transitions. [2021-08-27 06:32:07,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-08-27 06:32:07,991 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:32:07,991 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:32:07,997 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Ended with exit code 0 [2021-08-27 06:32:08,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Ended with exit code 0 [2021-08-27 06:32:08,394 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:32:08,395 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr18ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 47 more)] === [2021-08-27 06:32:08,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:32:08,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1734675453, now seen corresponding path program 1 times [2021-08-27 06:32:08,395 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:32:08,395 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2039590487] [2021-08-27 06:32:08,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:32:08,395 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:32:08,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:32:08,397 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:32:08,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2021-08-27 06:32:09,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:32:09,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 11 conjunts are in the unsatisfiable core [2021-08-27 06:32:09,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:32:09,309 INFO L354 Elim1Store]: treesize reduction 41, result has 25.5 percent of original size [2021-08-27 06:32:09,310 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 2 case distinctions, treesize of input 21 treesize of output 27 [2021-08-27 06:32:09,423 INFO L354 Elim1Store]: treesize reduction 30, result has 36.2 percent of original size [2021-08-27 06:32:09,423 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 36 [2021-08-27 06:32:09,543 INFO L354 Elim1Store]: treesize reduction 30, result has 36.2 percent of original size [2021-08-27 06:32:09,543 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 37 [2021-08-27 06:32:09,694 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-08-27 06:32:09,694 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 26 [2021-08-27 06:32:09,711 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-27 06:32:09,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:32:09,965 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-27 06:32:09,965 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:32:09,966 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2039590487] [2021-08-27 06:32:09,966 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2039590487] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:32:09,966 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:32:09,966 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 5 [2021-08-27 06:32:09,968 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367297320] [2021-08-27 06:32:09,969 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 06:32:09,969 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:32:09,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 06:32:09,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-27 06:32:09,970 INFO L87 Difference]: Start difference. First operand 121 states and 144 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 06:32:10,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:32:10,204 INFO L93 Difference]: Finished difference Result 120 states and 143 transitions. [2021-08-27 06:32:10,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 06:32:10,205 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2021-08-27 06:32:10,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:32:10,208 INFO L225 Difference]: With dead ends: 120 [2021-08-27 06:32:10,208 INFO L226 Difference]: Without dead ends: 120 [2021-08-27 06:32:10,208 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 100.9ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-08-27 06:32:10,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2021-08-27 06:32:10,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2021-08-27 06:32:10,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 99 states have (on average 1.404040404040404) internal successors, (139), 115 states have internal predecessors, (139), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:32:10,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 142 transitions. [2021-08-27 06:32:10,226 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 142 transitions. Word has length 23 [2021-08-27 06:32:10,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:32:10,226 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 142 transitions. [2021-08-27 06:32:10,227 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 06:32:10,227 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 142 transitions. [2021-08-27 06:32:10,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-27 06:32:10,228 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:32:10,228 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:32:10,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2021-08-27 06:32:10,440 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:32:10,440 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr36ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 47 more)] === [2021-08-27 06:32:10,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:32:10,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1175794259, now seen corresponding path program 1 times [2021-08-27 06:32:10,441 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:32:10,441 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1070351350] [2021-08-27 06:32:10,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:32:10,441 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:32:10,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:32:10,442 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:32:10,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2021-08-27 06:32:11,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:32:11,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 06:32:11,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:32:11,420 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-27 06:32:11,421 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:32:11,487 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-27 06:32:11,487 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:32:11,488 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1070351350] [2021-08-27 06:32:11,488 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1070351350] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:32:11,488 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:32:11,488 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-08-27 06:32:11,488 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305156221] [2021-08-27 06:32:11,488 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 06:32:11,488 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:32:11,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 06:32:11,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 06:32:11,489 INFO L87 Difference]: Start difference. First operand 119 states and 142 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:32:11,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:32:11,499 INFO L93 Difference]: Finished difference Result 121 states and 144 transitions. [2021-08-27 06:32:11,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 06:32:11,500 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2021-08-27 06:32:11,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:32:11,500 INFO L225 Difference]: With dead ends: 121 [2021-08-27 06:32:11,501 INFO L226 Difference]: Without dead ends: 121 [2021-08-27 06:32:11,501 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 06:32:11,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-08-27 06:32:11,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2021-08-27 06:32:11,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 101 states have (on average 1.396039603960396) internal successors, (141), 117 states have internal predecessors, (141), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:32:11,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 144 transitions. [2021-08-27 06:32:11,504 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 144 transitions. Word has length 24 [2021-08-27 06:32:11,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:32:11,505 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 144 transitions. [2021-08-27 06:32:11,505 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:32:11,505 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 144 transitions. [2021-08-27 06:32:11,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-27 06:32:11,507 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:32:11,507 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:32:11,520 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2021-08-27 06:32:11,714 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:32:11,715 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr49ASSERT_VIOLATIONMEMORY_FREE === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 47 more)] === [2021-08-27 06:32:11,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:32:11,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1619482515, now seen corresponding path program 1 times [2021-08-27 06:32:11,715 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:32:11,715 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [182136864] [2021-08-27 06:32:11,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:32:11,715 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:32:11,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:32:11,716 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:32:11,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2021-08-27 06:32:12,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:32:12,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 18 conjunts are in the unsatisfiable core [2021-08-27 06:32:12,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:32:12,683 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-08-27 06:32:12,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:32:12,724 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-08-27 06:32:12,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:32:12,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:32:12,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:32:12,772 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-27 06:32:12,772 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 23 [2021-08-27 06:32:12,900 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-27 06:32:12,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:32:12,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:32:12,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:32:12,911 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2021-08-27 06:32:12,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:32:12,964 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2021-08-27 06:32:13,118 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-27 06:32:13,119 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2021-08-27 06:32:13,194 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2021-08-27 06:32:13,260 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-27 06:32:13,260 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:32:13,542 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2021-08-27 06:32:13,593 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 59 [2021-08-27 06:32:13,846 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-27 06:32:13,846 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:32:13,847 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [182136864] [2021-08-27 06:32:13,847 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [182136864] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:32:13,847 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:32:13,847 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13, 12] imperfect sequences [] total 19 [2021-08-27 06:32:13,847 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767020508] [2021-08-27 06:32:13,847 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-08-27 06:32:13,848 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:32:13,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-08-27 06:32:13,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2021-08-27 06:32:13,848 INFO L87 Difference]: Start difference. First operand 121 states and 144 transitions. Second operand has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 19 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:32:15,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:32:15,427 INFO L93 Difference]: Finished difference Result 152 states and 166 transitions. [2021-08-27 06:32:15,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-27 06:32:15,428 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 19 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2021-08-27 06:32:15,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:32:15,429 INFO L225 Difference]: With dead ends: 152 [2021-08-27 06:32:15,429 INFO L226 Difference]: Without dead ends: 147 [2021-08-27 06:32:15,429 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 1080.2ms TimeCoverageRelationStatistics Valid=164, Invalid=538, Unknown=0, NotChecked=0, Total=702 [2021-08-27 06:32:15,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-08-27 06:32:15,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 117. [2021-08-27 06:32:15,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 97 states have (on average 1.402061855670103) internal successors, (136), 113 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:32:15,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 139 transitions. [2021-08-27 06:32:15,431 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 139 transitions. Word has length 24 [2021-08-27 06:32:15,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:32:15,431 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 139 transitions. [2021-08-27 06:32:15,431 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 19 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:32:15,431 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 139 transitions. [2021-08-27 06:32:15,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-27 06:32:15,431 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:32:15,432 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:32:15,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2021-08-27 06:32:15,632 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:32:15,632 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr34REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 47 more)] === [2021-08-27 06:32:15,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:32:15,633 INFO L82 PathProgramCache]: Analyzing trace with hash -2089836745, now seen corresponding path program 1 times [2021-08-27 06:32:15,633 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:32:15,633 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1013827564] [2021-08-27 06:32:15,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:32:15,633 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:32:15,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:32:15,634 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:32:15,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2021-08-27 06:32:16,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:32:16,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 06:32:16,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:32:16,607 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-08-27 06:32:16,622 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-27 06:32:16,622 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:32:16,681 INFO L354 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2021-08-27 06:32:16,682 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 24 treesize of output 23 [2021-08-27 06:32:16,744 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-27 06:32:16,744 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:32:16,744 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1013827564] [2021-08-27 06:32:16,744 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1013827564] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:32:16,744 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:32:16,745 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-08-27 06:32:16,745 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988849474] [2021-08-27 06:32:16,745 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 06:32:16,745 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:32:16,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 06:32:16,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 06:32:16,746 INFO L87 Difference]: Start difference. First operand 117 states and 139 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:32:17,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:32:17,128 INFO L93 Difference]: Finished difference Result 116 states and 137 transitions. [2021-08-27 06:32:17,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 06:32:17,129 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2021-08-27 06:32:17,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:32:17,130 INFO L225 Difference]: With dead ends: 116 [2021-08-27 06:32:17,130 INFO L226 Difference]: Without dead ends: 116 [2021-08-27 06:32:17,130 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 62.5ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-08-27 06:32:17,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-08-27 06:32:17,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2021-08-27 06:32:17,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 97 states have (on average 1.3814432989690721) internal successors, (134), 112 states have internal predecessors, (134), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:32:17,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 137 transitions. [2021-08-27 06:32:17,132 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 137 transitions. Word has length 25 [2021-08-27 06:32:17,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:32:17,132 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 137 transitions. [2021-08-27 06:32:17,132 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:32:17,132 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 137 transitions. [2021-08-27 06:32:17,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-27 06:32:17,132 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:32:17,132 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:32:17,146 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2021-08-27 06:32:17,332 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:32:17,333 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr35REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 47 more)] === [2021-08-27 06:32:17,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:32:17,333 INFO L82 PathProgramCache]: Analyzing trace with hash -2089836744, now seen corresponding path program 1 times [2021-08-27 06:32:17,333 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:32:17,333 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1363069315] [2021-08-27 06:32:17,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:32:17,333 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:32:17,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:32:17,334 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:32:17,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2021-08-27 06:32:18,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:32:18,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 7 conjunts are in the unsatisfiable core [2021-08-27 06:32:18,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:32:18,498 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2021-08-27 06:32:18,504 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2021-08-27 06:32:18,560 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-27 06:32:18,560 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:32:18,683 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-27 06:32:18,683 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 40 treesize of output 44 [2021-08-27 06:32:18,984 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-27 06:32:18,984 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:32:18,984 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1363069315] [2021-08-27 06:32:18,984 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1363069315] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:32:18,985 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:32:18,985 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 5 [2021-08-27 06:32:18,985 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104827337] [2021-08-27 06:32:18,985 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 06:32:18,985 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:32:18,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 06:32:18,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-08-27 06:32:18,986 INFO L87 Difference]: Start difference. First operand 116 states and 137 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:32:19,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:32:19,715 INFO L93 Difference]: Finished difference Result 115 states and 135 transitions. [2021-08-27 06:32:19,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 06:32:19,717 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2021-08-27 06:32:19,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:32:19,717 INFO L225 Difference]: With dead ends: 115 [2021-08-27 06:32:19,717 INFO L226 Difference]: Without dead ends: 115 [2021-08-27 06:32:19,717 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 273.7ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-27 06:32:19,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-08-27 06:32:19,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2021-08-27 06:32:19,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 97 states have (on average 1.3608247422680413) internal successors, (132), 111 states have internal predecessors, (132), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:32:19,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 135 transitions. [2021-08-27 06:32:19,719 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 135 transitions. Word has length 25 [2021-08-27 06:32:19,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:32:19,719 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 135 transitions. [2021-08-27 06:32:19,719 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:32:19,719 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 135 transitions. [2021-08-27 06:32:19,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-08-27 06:32:19,720 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:32:19,720 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:32:19,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2021-08-27 06:32:19,920 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:32:19,920 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr24REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 47 more)] === [2021-08-27 06:32:19,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:32:19,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1670584664, now seen corresponding path program 1 times [2021-08-27 06:32:19,921 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:32:19,921 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1822953907] [2021-08-27 06:32:19,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:32:19,921 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:32:19,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:32:19,922 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:32:19,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2021-08-27 06:32:20,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:32:20,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-27 06:32:20,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:32:21,020 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-08-27 06:32:21,051 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:32:21,051 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:32:21,129 INFO L354 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2021-08-27 06:32:21,130 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 24 treesize of output 23 [2021-08-27 06:32:21,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:32:21,190 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:32:21,190 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1822953907] [2021-08-27 06:32:21,190 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1822953907] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:32:21,190 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:32:21,190 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-08-27 06:32:21,191 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802140432] [2021-08-27 06:32:21,191 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 06:32:21,191 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:32:21,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 06:32:21,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-27 06:32:21,192 INFO L87 Difference]: Start difference. First operand 115 states and 135 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:32:21,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:32:21,695 INFO L93 Difference]: Finished difference Result 117 states and 134 transitions. [2021-08-27 06:32:21,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 06:32:21,696 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2021-08-27 06:32:21,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:32:21,696 INFO L225 Difference]: With dead ends: 117 [2021-08-27 06:32:21,696 INFO L226 Difference]: Without dead ends: 117 [2021-08-27 06:32:21,697 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 119.2ms TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-08-27 06:32:21,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-08-27 06:32:21,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2021-08-27 06:32:21,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 97 states have (on average 1.3402061855670102) internal successors, (130), 111 states have internal predecessors, (130), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:32:21,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 133 transitions. [2021-08-27 06:32:21,701 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 133 transitions. Word has length 27 [2021-08-27 06:32:21,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:32:21,702 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 133 transitions. [2021-08-27 06:32:21,702 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:32:21,702 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 133 transitions. [2021-08-27 06:32:21,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-08-27 06:32:21,702 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:32:21,702 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:32:21,710 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2021-08-27 06:32:21,909 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:32:21,910 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr25REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 47 more)] === [2021-08-27 06:32:21,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:32:21,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1670584665, now seen corresponding path program 1 times [2021-08-27 06:32:21,910 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:32:21,910 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [357798968] [2021-08-27 06:32:21,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:32:21,910 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:32:21,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:32:21,911 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:32:21,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2021-08-27 06:32:22,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:32:22,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 9 conjunts are in the unsatisfiable core [2021-08-27 06:32:22,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:32:23,118 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2021-08-27 06:32:23,121 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2021-08-27 06:32:23,223 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:32:23,223 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:32:23,368 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-27 06:32:23,368 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 40 treesize of output 44 [2021-08-27 06:32:23,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:32:23,617 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:32:23,617 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [357798968] [2021-08-27 06:32:23,617 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [357798968] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:32:23,617 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:32:23,617 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 6 [2021-08-27 06:32:23,617 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195722911] [2021-08-27 06:32:23,618 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 06:32:23,618 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:32:23,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 06:32:23,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-27 06:32:23,618 INFO L87 Difference]: Start difference. First operand 115 states and 133 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:32:24,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:32:24,827 INFO L93 Difference]: Finished difference Result 116 states and 132 transitions. [2021-08-27 06:32:24,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 06:32:24,828 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2021-08-27 06:32:24,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:32:24,829 INFO L225 Difference]: With dead ends: 116 [2021-08-27 06:32:24,829 INFO L226 Difference]: Without dead ends: 116 [2021-08-27 06:32:24,829 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 491.9ms TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-08-27 06:32:24,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-08-27 06:32:24,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2021-08-27 06:32:24,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 97 states have (on average 1.3195876288659794) internal successors, (128), 111 states have internal predecessors, (128), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:32:24,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 131 transitions. [2021-08-27 06:32:24,857 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 131 transitions. Word has length 27 [2021-08-27 06:32:24,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:32:24,857 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 131 transitions. [2021-08-27 06:32:24,857 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:32:24,857 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 131 transitions. [2021-08-27 06:32:24,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-08-27 06:32:24,858 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:32:24,858 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:32:24,868 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Ended with exit code 0 [2021-08-27 06:32:25,062 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:32:25,063 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr23ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 47 more)] === [2021-08-27 06:32:25,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:32:25,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1114168378, now seen corresponding path program 1 times [2021-08-27 06:32:25,063 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:32:25,063 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [104699784] [2021-08-27 06:32:25,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:32:25,063 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:32:25,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:32:25,064 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:32:25,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2021-08-27 06:32:26,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:32:26,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 06:32:26,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:32:26,229 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-27 06:32:26,230 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:32:26,342 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-27 06:32:26,343 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:32:26,343 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [104699784] [2021-08-27 06:32:26,343 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [104699784] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:32:26,343 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:32:26,343 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-08-27 06:32:26,343 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422641588] [2021-08-27 06:32:26,344 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 06:32:26,344 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:32:26,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 06:32:26,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 06:32:26,344 INFO L87 Difference]: Start difference. First operand 115 states and 131 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:32:26,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:32:26,384 INFO L93 Difference]: Finished difference Result 186 states and 207 transitions. [2021-08-27 06:32:26,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 06:32:26,385 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2021-08-27 06:32:26,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:32:26,386 INFO L225 Difference]: With dead ends: 186 [2021-08-27 06:32:26,386 INFO L226 Difference]: Without dead ends: 186 [2021-08-27 06:32:26,386 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 06:32:26,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2021-08-27 06:32:26,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 129. [2021-08-27 06:32:26,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 111 states have (on average 1.2972972972972974) internal successors, (144), 125 states have internal predecessors, (144), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:32:26,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 147 transitions. [2021-08-27 06:32:26,389 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 147 transitions. Word has length 27 [2021-08-27 06:32:26,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:32:26,389 INFO L470 AbstractCegarLoop]: Abstraction has 129 states and 147 transitions. [2021-08-27 06:32:26,389 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:32:26,389 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 147 transitions. [2021-08-27 06:32:26,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-08-27 06:32:26,389 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:32:26,389 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:32:26,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Ended with exit code 0 [2021-08-27 06:32:26,598 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:32:26,598 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr36ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 47 more)] === [2021-08-27 06:32:26,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:32:26,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1519591669, now seen corresponding path program 1 times [2021-08-27 06:32:26,598 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:32:26,598 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1436211152] [2021-08-27 06:32:26,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:32:26,599 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:32:26,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:32:26,599 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:32:26,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2021-08-27 06:32:27,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:32:27,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 23 conjunts are in the unsatisfiable core [2021-08-27 06:32:27,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:32:27,745 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-08-27 06:32:27,752 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-08-27 06:32:27,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:32:27,789 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-08-27 06:32:27,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:32:27,801 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-08-27 06:32:27,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:32:27,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:32:27,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:32:27,862 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-27 06:32:27,862 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 23 [2021-08-27 06:32:27,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:32:27,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:32:27,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:32:27,881 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2021-08-27 06:32:28,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:32:28,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:32:28,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:32:28,080 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-27 06:32:28,080 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 23 [2021-08-27 06:32:28,092 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-27 06:32:28,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:32:28,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:32:28,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:32:28,107 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2021-08-27 06:32:35,068 INFO L354 Elim1Store]: treesize reduction 30, result has 9.1 percent of original size [2021-08-27 06:32:35,069 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 61 [2021-08-27 06:32:35,085 INFO L354 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2021-08-27 06:32:35,085 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 32 [2021-08-27 06:32:35,151 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-08-27 06:32:35,255 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-27 06:32:35,256 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:32:39,972 INFO L354 Elim1Store]: treesize reduction 8, result has 83.0 percent of original size [2021-08-27 06:32:39,972 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 298 treesize of output 249 [2021-08-27 06:32:53,073 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:32:53,074 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1436211152] [2021-08-27 06:32:53,074 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Alternating quantifiers not yet supported [2021-08-27 06:32:53,074 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1575753891] [2021-08-27 06:32:53,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:32:53,074 INFO L170 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-08-27 06:32:53,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-08-27 06:32:53,075 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-08-27 06:32:53,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (30)] Waiting until timeout for monitored process [2021-08-27 06:32:54,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:32:54,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 27 conjunts are in the unsatisfiable core [2021-08-27 06:32:54,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:32:54,404 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-27 06:32:54,482 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-08-27 06:32:56,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:32:56,668 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-08-27 06:32:56,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:32:56,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:32:56,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:32:56,827 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2021-08-27 06:32:57,084 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-27 06:32:57,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:32:57,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:32:57,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:32:57,102 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2021-08-27 06:32:57,117 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2021-08-27 06:33:08,580 INFO L354 Elim1Store]: treesize reduction 30, result has 9.1 percent of original size [2021-08-27 06:33:08,581 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 132 treesize of output 102 [2021-08-27 06:33:08,599 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-08-27 06:33:08,600 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 57 [2021-08-27 06:33:08,605 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 48 treesize of output 42 [2021-08-27 06:33:08,703 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-08-27 06:33:08,727 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-27 06:33:08,727 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:33:14,491 INFO L354 Elim1Store]: treesize reduction 8, result has 83.0 percent of original size [2021-08-27 06:33:14,491 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 360 treesize of output 311 [2021-08-27 06:33:14,635 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-27 06:33:14,635 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 1390 treesize of output 1248 [2021-08-27 06:34:11,105 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 102 [2021-08-27 06:34:11,391 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-27 06:34:11,391 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1575753891] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:34:11,391 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:34:11,391 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13, 12] imperfect sequences [] total 22 [2021-08-27 06:34:11,392 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91485272] [2021-08-27 06:34:11,392 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-08-27 06:34:11,392 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:34:11,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-08-27 06:34:11,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1108, Unknown=11, NotChecked=0, Total=1260 [2021-08-27 06:34:11,393 INFO L87 Difference]: Start difference. First operand 129 states and 147 transitions. Second operand has 22 states, 22 states have (on average 2.090909090909091) internal successors, (46), 22 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:35:01,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:35:01,445 INFO L93 Difference]: Finished difference Result 159 states and 173 transitions. [2021-08-27 06:35:01,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-08-27 06:35:01,447 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.090909090909091) internal successors, (46), 22 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2021-08-27 06:35:01,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:35:01,447 INFO L225 Difference]: With dead ends: 159 [2021-08-27 06:35:01,447 INFO L226 Difference]: Without dead ends: 159 [2021-08-27 06:35:01,448 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 625 ImplicationChecksByTransitivity, 66480.4ms TimeCoverageRelationStatistics Valid=394, Invalid=2245, Unknown=13, NotChecked=0, Total=2652 [2021-08-27 06:35:01,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-08-27 06:35:01,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 135. [2021-08-27 06:35:01,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 117 states have (on average 1.2905982905982907) internal successors, (151), 131 states have internal predecessors, (151), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:35:01,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 154 transitions. [2021-08-27 06:35:01,450 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 154 transitions. Word has length 28 [2021-08-27 06:35:01,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:35:01,450 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 154 transitions. [2021-08-27 06:35:01,450 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.090909090909091) internal successors, (46), 22 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:35:01,450 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 154 transitions. [2021-08-27 06:35:01,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-08-27 06:35:01,450 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:35:01,451 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:35:01,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (30)] Forceful destruction successful, exit code 0 [2021-08-27 06:35:01,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2021-08-27 06:35:01,856 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:35:01,857 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr27REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 47 more)] === [2021-08-27 06:35:01,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:35:01,857 INFO L82 PathProgramCache]: Analyzing trace with hash -885902915, now seen corresponding path program 1 times [2021-08-27 06:35:01,857 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:35:01,857 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1112185445] [2021-08-27 06:35:01,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:35:01,857 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:35:01,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:35:01,859 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:35:01,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2021-08-27 06:35:03,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:35:03,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 11 conjunts are in the unsatisfiable core [2021-08-27 06:35:03,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:35:03,390 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2021-08-27 06:35:03,395 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-08-27 06:35:03,470 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-08-27 06:35:03,506 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:35:03,506 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:35:03,703 INFO L354 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2021-08-27 06:35:03,703 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 23 [2021-08-27 06:35:03,775 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:35:03,775 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:35:03,776 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1112185445] [2021-08-27 06:35:03,776 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1112185445] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:35:03,776 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:35:03,776 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 11 [2021-08-27 06:35:03,776 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922551977] [2021-08-27 06:35:03,776 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-27 06:35:03,776 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:35:03,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-27 06:35:03,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-08-27 06:35:03,778 INFO L87 Difference]: Start difference. First operand 135 states and 154 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:35:04,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:35:04,677 INFO L93 Difference]: Finished difference Result 150 states and 169 transitions. [2021-08-27 06:35:04,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 06:35:04,678 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2021-08-27 06:35:04,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:35:04,679 INFO L225 Difference]: With dead ends: 150 [2021-08-27 06:35:04,679 INFO L226 Difference]: Without dead ends: 150 [2021-08-27 06:35:04,679 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 479.2ms TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2021-08-27 06:35:04,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2021-08-27 06:35:04,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 146. [2021-08-27 06:35:04,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 128 states have (on average 1.265625) internal successors, (162), 142 states have internal predecessors, (162), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:35:04,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 165 transitions. [2021-08-27 06:35:04,681 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 165 transitions. Word has length 29 [2021-08-27 06:35:04,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:35:04,682 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 165 transitions. [2021-08-27 06:35:04,682 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:35:04,682 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 165 transitions. [2021-08-27 06:35:04,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-08-27 06:35:04,682 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:35:04,682 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:35:04,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2021-08-27 06:35:04,889 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:35:04,889 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting mainErr23ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 47 more)] === [2021-08-27 06:35:04,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:35:04,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1237135384, now seen corresponding path program 1 times [2021-08-27 06:35:04,889 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:35:04,889 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1691082669] [2021-08-27 06:35:04,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:35:04,890 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:35:04,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:35:04,891 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:35:04,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2021-08-27 06:35:06,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:35:06,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 16 conjunts are in the unsatisfiable core [2021-08-27 06:35:06,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:35:06,298 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-27 06:35:06,412 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 06:35:06,413 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2021-08-27 06:35:06,463 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2021-08-27 06:35:06,662 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-08-27 06:35:06,662 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 28 [2021-08-27 06:35:06,974 INFO L354 Elim1Store]: treesize reduction 68, result has 20.0 percent of original size [2021-08-27 06:35:06,975 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 41 [2021-08-27 06:35:09,663 INFO L354 Elim1Store]: treesize reduction 62, result has 27.1 percent of original size [2021-08-27 06:35:09,663 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 39 [2021-08-27 06:35:13,903 INFO L354 Elim1Store]: treesize reduction 72, result has 17.2 percent of original size [2021-08-27 06:35:13,904 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 44 [2021-08-27 06:35:13,979 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 06:35:13,980 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 18 [2021-08-27 06:35:14,064 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-27 06:35:14,064 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:35:16,270 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~x~0.offset (_ BitVec 32)) (v_DerPreprocessor_29 (_ BitVec 32))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_main_~x~0.base (store (store (select |c_#memory_$Pointer$.base| c_main_~x~0.base) main_~x~0.offset c_main_~head~0.base) (bvadd (_ bv8 32) main_~x~0.offset) v_DerPreprocessor_29)) c_main_~head~0.base) c_main_~head~0.offset) (_ bv0 32)))) is different from false [2021-08-27 06:35:18,285 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~x~0.offset (_ BitVec 32)) (v_DerPreprocessor_29 (_ BitVec 32))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_main_#t~mem7.base| (store (store (select |c_#memory_$Pointer$.base| |c_main_#t~mem7.base|) main_~x~0.offset c_main_~head~0.base) (bvadd (_ bv8 32) main_~x~0.offset) v_DerPreprocessor_29)) c_main_~head~0.base) c_main_~head~0.offset) (_ bv0 32)))) is different from false [2021-08-27 06:35:20,302 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~x~0.offset_88 (_ BitVec 32)) (v_DerPreprocessor_29 (_ BitVec 32))) (not (= (_ bv0 32) (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_main_~x~0.base) c_main_~x~0.offset))) (store |c_#memory_$Pointer$.base| .cse0 (store (store (select |c_#memory_$Pointer$.base| .cse0) v_main_~x~0.offset_88 c_main_~head~0.base) (bvadd (_ bv8 32) v_main_~x~0.offset_88) v_DerPreprocessor_29))) c_main_~head~0.base) c_main_~head~0.offset)))) is different from false [2021-08-27 06:35:22,336 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~x~0.offset_88 (_ BitVec 32)) (|main_#t~mem6.offset| (_ BitVec 32)) (v_DerPreprocessor_29 (_ BitVec 32))) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_main_#t~mem6.base| (store (select |c_#memory_$Pointer$.base| |c_main_#t~mem6.base|) (bvadd |main_#t~mem6.offset| (_ bv4 32)) c_main_~x~0.base)))) (let ((.cse1 (select (select .cse0 c_main_~x~0.base) c_main_~x~0.offset))) (store .cse0 .cse1 (store (store (select .cse0 .cse1) v_main_~x~0.offset_88 c_main_~head~0.base) (bvadd (_ bv8 32) v_main_~x~0.offset_88) v_DerPreprocessor_29)))) c_main_~head~0.base) c_main_~head~0.offset) (_ bv0 32)))) is different from false [2021-08-27 06:35:24,365 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~x~0.offset_88 (_ BitVec 32)) (|main_#t~mem6.offset| (_ BitVec 32)) (v_DerPreprocessor_29 (_ BitVec 32))) (not (= (select (select (let ((.cse0 (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_main_~x~0.base) c_main_~x~0.offset))) (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) (bvadd |main_#t~mem6.offset| (_ bv4 32)) c_main_~x~0.base))))) (let ((.cse1 (select (select .cse0 c_main_~x~0.base) c_main_~x~0.offset))) (store .cse0 .cse1 (store (store (select .cse0 .cse1) v_main_~x~0.offset_88 c_main_~head~0.base) (bvadd (_ bv8 32) v_main_~x~0.offset_88) v_DerPreprocessor_29)))) c_main_~head~0.base) c_main_~head~0.offset) (_ bv0 32)))) is different from false [2021-08-27 06:35:24,394 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1912 treesize of output 1904 [2021-08-27 06:35:25,505 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-27 06:35:25,505 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:35:25,505 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1691082669] [2021-08-27 06:35:25,505 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1691082669] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-27 06:35:25,505 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 06:35:25,505 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 24 [2021-08-27 06:35:25,505 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095179065] [2021-08-27 06:35:25,505 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-08-27 06:35:25,505 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:35:25,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-08-27 06:35:25,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=278, Unknown=7, NotChecked=190, Total=552 [2021-08-27 06:35:25,506 INFO L87 Difference]: Start difference. First operand 146 states and 165 transitions. Second operand has 24 states, 24 states have (on average 1.9583333333333333) internal successors, (47), 24 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:29,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:36:29,977 INFO L93 Difference]: Finished difference Result 256 states and 283 transitions. [2021-08-27 06:36:29,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-08-27 06:36:29,978 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.9583333333333333) internal successors, (47), 24 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2021-08-27 06:36:29,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:36:29,979 INFO L225 Difference]: With dead ends: 256 [2021-08-27 06:36:29,979 INFO L226 Difference]: Without dead ends: 256 [2021-08-27 06:36:29,980 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 48708.1ms TimeCoverageRelationStatistics Valid=269, Invalid=926, Unknown=15, NotChecked=350, Total=1560 [2021-08-27 06:36:29,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2021-08-27 06:36:29,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 168. [2021-08-27 06:36:29,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 150 states have (on average 1.2466666666666666) internal successors, (187), 164 states have internal predecessors, (187), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:29,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 190 transitions. [2021-08-27 06:36:29,982 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 190 transitions. Word has length 29 [2021-08-27 06:36:29,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:36:29,982 INFO L470 AbstractCegarLoop]: Abstraction has 168 states and 190 transitions. [2021-08-27 06:36:29,982 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.9583333333333333) internal successors, (47), 24 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:36:29,983 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 190 transitions. [2021-08-27 06:36:29,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-08-27 06:36:29,983 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:36:29,983 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:36:30,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2021-08-27 06:36:30,183 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:36:30,184 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting mainErr24REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 47 more)] === [2021-08-27 06:36:30,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:36:30,185 INFO L82 PathProgramCache]: Analyzing trace with hash 303512960, now seen corresponding path program 1 times [2021-08-27 06:36:30,186 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:36:30,186 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1125051334] [2021-08-27 06:36:30,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:36:30,186 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:36:30,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:36:30,187 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:36:30,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2021-08-27 06:36:31,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:36:31,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 16 conjunts are in the unsatisfiable core [2021-08-27 06:36:31,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:36:31,675 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-27 06:36:31,816 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-08-27 06:36:31,816 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 30 [2021-08-27 06:36:31,908 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2021-08-27 06:36:32,122 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-08-27 06:36:32,122 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 33 [2021-08-27 06:36:32,447 INFO L354 Elim1Store]: treesize reduction 68, result has 20.0 percent of original size [2021-08-27 06:36:32,447 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 47 [2021-08-27 06:36:35,138 INFO L354 Elim1Store]: treesize reduction 62, result has 27.1 percent of original size [2021-08-27 06:36:35,138 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 39 [2021-08-27 06:36:39,419 INFO L354 Elim1Store]: treesize reduction 72, result has 17.2 percent of original size [2021-08-27 06:36:39,420 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 50 [2021-08-27 06:36:39,496 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 06:36:39,497 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 43 [2021-08-27 06:36:39,709 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-27 06:36:39,709 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:36:45,977 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~x~0.offset (_ BitVec 32)) (v_DerPreprocessor_31 (_ BitVec 32))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| c_main_~x~0.base (store (store (select |c_#memory_$Pointer$.base| c_main_~x~0.base) main_~x~0.offset c_main_~head~0.base) (bvadd (_ bv8 32) main_~x~0.offset) v_DerPreprocessor_31)) c_main_~head~0.base) c_main_~head~0.offset))))))))) (_ bv1 1)))) is different from false [2021-08-27 06:36:47,993 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~x~0.offset (_ BitVec 32)) (v_DerPreprocessor_31 (_ BitVec 32))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_main_#t~mem7.base| (store (store (select |c_#memory_$Pointer$.base| |c_main_#t~mem7.base|) main_~x~0.offset c_main_~head~0.base) (bvadd (_ bv8 32) main_~x~0.offset) v_DerPreprocessor_31)) c_main_~head~0.base) c_main_~head~0.offset))))))))))) (_ bv1 1)))) is different from false [2021-08-27 06:36:50,017 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_31 (_ BitVec 32)) (v_main_~x~0.offset_92 (_ BitVec 32))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_main_~x~0.base) c_main_~x~0.offset))) (store |c_#memory_$Pointer$.base| .cse0 (store (store (select |c_#memory_$Pointer$.base| .cse0) v_main_~x~0.offset_92 c_main_~head~0.base) (bvadd (_ bv8 32) v_main_~x~0.offset_92) v_DerPreprocessor_31))) c_main_~head~0.base) c_main_~head~0.offset))))))))))))) (_ bv1 1)))) is different from false [2021-08-27 06:37:08,084 WARN L838 $PredicateComparison]: unable to prove that (forall ((|main_#t~mem6.offset| (_ BitVec 32)) (v_DerPreprocessor_31 (_ BitVec 32)) (v_main_~x~0.offset_92 (_ BitVec 32))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (let ((.cse0 (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_main_~x~0.base) c_main_~x~0.offset))) (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) (bvadd |main_#t~mem6.offset| (_ bv4 32)) c_main_~x~0.base))))) (let ((.cse1 (select (select .cse0 c_main_~x~0.base) c_main_~x~0.offset))) (store .cse0 .cse1 (store (store (select .cse0 .cse1) v_main_~x~0.offset_92 c_main_~head~0.base) (bvadd (_ bv8 32) v_main_~x~0.offset_92) v_DerPreprocessor_31)))) c_main_~head~0.base) c_main_~head~0.offset)))))))))))))))) (_ bv1 1)))) is different from false [2021-08-27 06:37:08,110 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1262 treesize of output 1258 [2021-08-27 06:37:29,889 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-27 06:37:29,890 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:37:29,890 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1125051334] [2021-08-27 06:37:29,890 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1125051334] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-27 06:37:29,890 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 06:37:29,890 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2021-08-27 06:37:29,890 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603760858] [2021-08-27 06:37:29,891 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-08-27 06:37:29,891 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:37:29,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-08-27 06:37:29,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=382, Unknown=15, NotChecked=180, Total=702 [2021-08-27 06:37:29,892 INFO L87 Difference]: Start difference. First operand 168 states and 190 transitions. Second operand has 27 states, 26 states have (on average 2.0) internal successors, (52), 27 states have internal predecessors, (52), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:38:57,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:38:57,809 INFO L93 Difference]: Finished difference Result 253 states and 280 transitions. [2021-08-27 06:38:57,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-08-27 06:38:57,810 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.0) internal successors, (52), 27 states have internal predecessors, (52), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2021-08-27 06:38:57,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:38:57,811 INFO L225 Difference]: With dead ends: 253 [2021-08-27 06:38:57,811 INFO L226 Difference]: Without dead ends: 253 [2021-08-27 06:38:57,812 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 30 SyntacticMatches, 7 SemanticMatches, 39 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 68241.6ms TimeCoverageRelationStatistics Valid=364, Invalid=961, Unknown=23, NotChecked=292, Total=1640 [2021-08-27 06:38:57,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2021-08-27 06:38:57,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 170. [2021-08-27 06:38:57,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 152 states have (on average 1.25) internal successors, (190), 166 states have internal predecessors, (190), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:38:57,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 193 transitions. [2021-08-27 06:38:57,814 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 193 transitions. Word has length 30 [2021-08-27 06:38:57,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:38:57,814 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 193 transitions. [2021-08-27 06:38:57,814 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.0) internal successors, (52), 27 states have internal predecessors, (52), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:38:57,814 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 193 transitions. [2021-08-27 06:38:57,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-08-27 06:38:57,814 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:38:57,815 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:38:57,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Forceful destruction successful, exit code 0 [2021-08-27 06:38:58,015 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:38:58,015 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting mainErr25REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 47 more)] === [2021-08-27 06:38:58,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:38:58,016 INFO L82 PathProgramCache]: Analyzing trace with hash 303512961, now seen corresponding path program 1 times [2021-08-27 06:38:58,016 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:38:58,016 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [613268092] [2021-08-27 06:38:58,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:38:58,017 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:38:58,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:38:58,017 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:38:58,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2021-08-27 06:38:59,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:38:59,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 24 conjunts are in the unsatisfiable core [2021-08-27 06:38:59,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:38:59,580 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-27 06:38:59,666 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 06:38:59,666 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 19 treesize of output 19 [2021-08-27 06:38:59,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 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 06:38:59,745 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-08-27 06:38:59,753 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-08-27 06:38:59,958 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-08-27 06:38:59,959 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 49 [2021-08-27 06:38:59,987 INFO L354 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2021-08-27 06:38:59,987 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 54 [2021-08-27 06:39:00,358 INFO L354 Elim1Store]: treesize reduction 84, result has 20.0 percent of original size [2021-08-27 06:39:00,359 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 82 [2021-08-27 06:39:01,441 INFO L354 Elim1Store]: treesize reduction 68, result has 20.0 percent of original size [2021-08-27 06:39:01,441 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 65 [2021-08-27 06:39:04,644 INFO L354 Elim1Store]: treesize reduction 62, result has 27.1 percent of original size [2021-08-27 06:39:04,645 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 81 [2021-08-27 06:39:05,237 INFO L354 Elim1Store]: treesize reduction 62, result has 27.1 percent of original size [2021-08-27 06:39:05,237 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 68 [2021-08-27 06:39:09,530 INFO L354 Elim1Store]: treesize reduction 72, result has 17.2 percent of original size [2021-08-27 06:39:09,530 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 78 [2021-08-27 06:39:09,566 INFO L354 Elim1Store]: treesize reduction 96, result has 16.5 percent of original size [2021-08-27 06:39:09,566 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 53 [2021-08-27 06:39:09,653 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 06:39:09,653 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 40 [2021-08-27 06:39:09,660 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 06:39:09,660 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 19 [2021-08-27 06:39:09,774 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-27 06:39:09,774 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:39:10,587 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:39:10,587 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [613268092] [2021-08-27 06:39:10,587 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Alternating quantifiers not yet supported [2021-08-27 06:39:10,587 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [445415528] [2021-08-27 06:39:10,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:39:10,587 INFO L170 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-08-27 06:39:10,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-08-27 06:39:10,608 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-08-27 06:39:10,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2021-08-27 06:39:12,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:39:12,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 25 conjunts are in the unsatisfiable core [2021-08-27 06:39:12,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:39:12,568 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-27 06:39:12,881 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-27 06:39:12,911 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 06:39:12,911 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 17 treesize of output 17 [2021-08-27 06:39:13,006 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-08-27 06:39:13,018 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-08-27 06:39:13,287 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-08-27 06:39:13,287 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 49 [2021-08-27 06:39:13,311 INFO L354 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2021-08-27 06:39:13,311 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 54 [2021-08-27 06:39:16,256 INFO L354 Elim1Store]: treesize reduction 68, result has 20.0 percent of original size [2021-08-27 06:39:16,256 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 69 [2021-08-27 06:39:17,735 INFO L354 Elim1Store]: treesize reduction 60, result has 22.1 percent of original size [2021-08-27 06:39:17,735 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 62 [2021-08-27 06:39:22,781 INFO L354 Elim1Store]: treesize reduction 62, result has 27.1 percent of original size [2021-08-27 06:39:22,781 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 81 [2021-08-27 06:39:23,434 INFO L354 Elim1Store]: treesize reduction 62, result has 27.1 percent of original size [2021-08-27 06:39:23,434 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 68 [2021-08-27 06:39:31,824 INFO L354 Elim1Store]: treesize reduction 72, result has 17.2 percent of original size [2021-08-27 06:39:31,825 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 78 [2021-08-27 06:39:31,862 INFO L354 Elim1Store]: treesize reduction 96, result has 16.5 percent of original size [2021-08-27 06:39:31,863 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 53 [2021-08-27 06:39:32,007 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 06:39:32,007 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 40 [2021-08-27 06:39:32,014 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 06:39:32,014 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 19 [2021-08-27 06:39:32,058 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-27 06:39:32,058 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:39:32,818 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Alternating quantifiers not yet supported [2021-08-27 06:39:32,818 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [21925315] [2021-08-27 06:39:32,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:39:32,818 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:39:32,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:39:32,820 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 06:39:32,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2021-08-27 06:39:34,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:39:34,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 24 conjunts are in the unsatisfiable core [2021-08-27 06:39:34,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:39:34,693 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 06:39:34,694 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 17 treesize of output 17 [2021-08-27 06:39:34,709 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 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 06:39:34,737 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-08-27 06:39:34,752 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-08-27 06:39:34,883 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-08-27 06:39:34,883 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 49 [2021-08-27 06:39:34,910 INFO L354 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2021-08-27 06:39:34,911 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 54 [2021-08-27 06:39:36,252 INFO L354 Elim1Store]: treesize reduction 68, result has 20.0 percent of original size [2021-08-27 06:39:36,252 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 69 [2021-08-27 06:39:36,296 INFO L354 Elim1Store]: treesize reduction 60, result has 22.1 percent of original size [2021-08-27 06:39:36,296 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 62 [2021-08-27 06:39:37,219 INFO L354 Elim1Store]: treesize reduction 62, result has 27.1 percent of original size [2021-08-27 06:39:37,219 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 81 [2021-08-27 06:39:37,837 INFO L354 Elim1Store]: treesize reduction 62, result has 27.1 percent of original size [2021-08-27 06:39:37,837 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 68 [2021-08-27 06:39:38,058 INFO L354 Elim1Store]: treesize reduction 72, result has 17.2 percent of original size [2021-08-27 06:39:38,058 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 78 [2021-08-27 06:39:38,089 INFO L354 Elim1Store]: treesize reduction 96, result has 16.5 percent of original size [2021-08-27 06:39:38,090 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 53 [2021-08-27 06:39:38,128 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 06:39:38,129 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 40 [2021-08-27 06:39:38,141 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 06:39:38,142 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 19 [2021-08-27 06:39:38,176 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-27 06:39:38,176 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:39:39,016 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Alternating quantifiers not yet supported [2021-08-27 06:39:39,016 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:39:39,017 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2021-08-27 06:39:39,017 ERROR L172 FreeRefinementEngine]: Strategy WOLF failed to provide any proof altough trace is infeasible [2021-08-27 06:39:39,017 INFO L626 BasicCegarLoop]: Counterexample might be feasible [2021-08-27 06:39:39,020 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr25REQUIRES_VIOLATION [2021-08-27 06:39:39,021 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr0REQUIRES_VIOLATION [2021-08-27 06:39:39,021 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr1REQUIRES_VIOLATION [2021-08-27 06:39:39,021 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr2REQUIRES_VIOLATION [2021-08-27 06:39:39,021 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr3REQUIRES_VIOLATION [2021-08-27 06:39:39,021 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr4REQUIRES_VIOLATION [2021-08-27 06:39:39,022 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr5REQUIRES_VIOLATION [2021-08-27 06:39:39,022 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr6REQUIRES_VIOLATION [2021-08-27 06:39:39,022 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr7REQUIRES_VIOLATION [2021-08-27 06:39:39,022 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr8REQUIRES_VIOLATION [2021-08-27 06:39:39,022 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr9REQUIRES_VIOLATION [2021-08-27 06:39:39,022 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr10REQUIRES_VIOLATION [2021-08-27 06:39:39,022 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr11REQUIRES_VIOLATION [2021-08-27 06:39:39,022 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr12REQUIRES_VIOLATION [2021-08-27 06:39:39,023 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr13REQUIRES_VIOLATION [2021-08-27 06:39:39,023 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr14REQUIRES_VIOLATION [2021-08-27 06:39:39,023 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr15REQUIRES_VIOLATION [2021-08-27 06:39:39,023 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr16REQUIRES_VIOLATION [2021-08-27 06:39:39,023 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr17REQUIRES_VIOLATION [2021-08-27 06:39:39,023 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr18ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 06:39:39,023 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr19REQUIRES_VIOLATION [2021-08-27 06:39:39,023 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr20REQUIRES_VIOLATION [2021-08-27 06:39:39,024 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr21REQUIRES_VIOLATION [2021-08-27 06:39:39,024 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr22REQUIRES_VIOLATION [2021-08-27 06:39:39,024 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr23ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 06:39:39,024 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr24REQUIRES_VIOLATION [2021-08-27 06:39:39,024 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr26REQUIRES_VIOLATION [2021-08-27 06:39:39,024 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr27REQUIRES_VIOLATION [2021-08-27 06:39:39,024 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr28REQUIRES_VIOLATION [2021-08-27 06:39:39,024 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr29REQUIRES_VIOLATION [2021-08-27 06:39:39,024 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr30REQUIRES_VIOLATION [2021-08-27 06:39:39,025 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr31REQUIRES_VIOLATION [2021-08-27 06:39:39,025 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr32REQUIRES_VIOLATION [2021-08-27 06:39:39,025 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr33REQUIRES_VIOLATION [2021-08-27 06:39:39,025 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr34REQUIRES_VIOLATION [2021-08-27 06:39:39,025 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr35REQUIRES_VIOLATION [2021-08-27 06:39:39,025 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr36ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 06:39:39,025 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr37REQUIRES_VIOLATION [2021-08-27 06:39:39,025 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr38REQUIRES_VIOLATION [2021-08-27 06:39:39,026 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr39REQUIRES_VIOLATION [2021-08-27 06:39:39,026 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr40REQUIRES_VIOLATION [2021-08-27 06:39:39,026 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr41REQUIRES_VIOLATION [2021-08-27 06:39:39,026 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr42REQUIRES_VIOLATION [2021-08-27 06:39:39,026 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr43REQUIRES_VIOLATION [2021-08-27 06:39:39,026 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr44REQUIRES_VIOLATION [2021-08-27 06:39:39,026 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr45ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:39:39,026 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr46ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:39:39,027 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr47ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:39:39,027 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr48ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:39:39,027 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr49ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:39:39,027 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr50ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:39:39,027 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr51ENSURES_VIOLATIONMEMORY_LEAK [2021-08-27 06:39:39,048 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2021-08-27 06:39:39,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Forceful destruction successful, exit code 0 [2021-08-27 06:39:39,462 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (35)] Forceful destruction successful, exit code 0 [2021-08-27 06:39:39,656 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2021-08-27 06:39:39,661 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-27 06:39:39,668 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 06:39:39 BoogieIcfgContainer [2021-08-27 06:39:39,669 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-27 06:39:39,669 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 06:39:39,669 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 06:39:39,669 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 06:39:39,669 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 06:28:18" (3/4) ... [2021-08-27 06:39:39,671 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-27 06:39:39,671 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 06:39:39,672 INFO L168 Benchmark]: Toolchain (without parser) took 682322.41 ms. Allocated memory was 50.3 MB in the beginning and 207.6 MB in the end (delta: 157.3 MB). Free memory was 26.1 MB in the beginning and 53.9 MB in the end (delta: -27.8 MB). Peak memory consumption was 130.3 MB. Max. memory is 16.1 GB. [2021-08-27 06:39:39,672 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 50.3 MB. Free memory was 32.1 MB in the beginning and 32.0 MB in the end (delta: 38.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 06:39:39,672 INFO L168 Benchmark]: CACSL2BoogieTranslator took 257.09 ms. Allocated memory was 50.3 MB in the beginning and 65.0 MB in the end (delta: 14.7 MB). Free memory was 25.9 MB in the beginning and 40.9 MB in the end (delta: -15.0 MB). Peak memory consumption was 3.7 MB. Max. memory is 16.1 GB. [2021-08-27 06:39:39,672 INFO L168 Benchmark]: Boogie Preprocessor took 34.51 ms. Allocated memory is still 65.0 MB. Free memory was 40.9 MB in the beginning and 37.7 MB in the end (delta: 3.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-27 06:39:39,672 INFO L168 Benchmark]: RCFGBuilder took 790.24 ms. Allocated memory is still 65.0 MB. Free memory was 37.7 MB in the beginning and 33.9 MB in the end (delta: 3.8 MB). Peak memory consumption was 18.0 MB. Max. memory is 16.1 GB. [2021-08-27 06:39:39,673 INFO L168 Benchmark]: TraceAbstraction took 681225.14 ms. Allocated memory was 65.0 MB in the beginning and 207.6 MB in the end (delta: 142.6 MB). Free memory was 33.5 MB in the beginning and 53.9 MB in the end (delta: -20.4 MB). Peak memory consumption was 122.5 MB. Max. memory is 16.1 GB. [2021-08-27 06:39:39,673 INFO L168 Benchmark]: Witness Printer took 2.28 ms. Allocated memory is still 207.6 MB. Free memory is still 53.9 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 06:39:39,674 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.14 ms. Allocated memory is still 50.3 MB. Free memory was 32.1 MB in the beginning and 32.0 MB in the end (delta: 38.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 257.09 ms. Allocated memory was 50.3 MB in the beginning and 65.0 MB in the end (delta: 14.7 MB). Free memory was 25.9 MB in the beginning and 40.9 MB in the end (delta: -15.0 MB). Peak memory consumption was 3.7 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 34.51 ms. Allocated memory is still 65.0 MB. Free memory was 40.9 MB in the beginning and 37.7 MB in the end (delta: 3.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 790.24 ms. Allocated memory is still 65.0 MB. Free memory was 37.7 MB in the beginning and 33.9 MB in the end (delta: 3.8 MB). Peak memory consumption was 18.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 681225.14 ms. Allocated memory was 65.0 MB in the beginning and 207.6 MB in the end (delta: 142.6 MB). Free memory was 33.5 MB in the beginning and 53.9 MB in the end (delta: -20.4 MB). Peak memory consumption was 122.5 MB. Max. memory is 16.1 GB. * Witness Printer took 2.28 ms. Allocated memory is still 207.6 MB. Free memory is still 53.9 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1033]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L997] SLL* head = malloc(sizeof(SLL)); [L998] head->next = head [L999] head->prev = ((void*)0) [L1000] head->data = 0 [L1002] SLL* x = head; [L1003] int state = 1; [L1006] COND TRUE __VERIFIER_nondet_int() [L1009] x->next = malloc(sizeof(SLL)) [L1010] EXPR x->next [L1010] x->next->prev = x [L1011] EXPR x->next [L1011] x = x->next [L1012] x->next = head [L1014] COND FALSE !(__VERIFIER_nondet_int()) [L1024] x->data = state [L1026] COND FALSE !(!(((void*)0) != x)) [L1006] COND FALSE !(__VERIFIER_nondet_int()) [L1028] x->data = state [L1030] EXPR head->next [L1030] x = head->next [L1031] COND FALSE !(!(((void*)0) != x)) [L1033] x->data - UnprovableResult [Line: 998]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 998]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 999]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 999]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1009]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1009]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1010]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1010]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1010]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1010]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1011]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1011]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1012]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1012]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1024]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1024]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1026]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1028]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1028]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1030]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1030]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1031]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1033]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1035]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1035]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1035]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1035]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1035]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1035]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1035]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1035]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1035]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1035]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1035]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1036]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1036]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1039]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1039]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1041]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1041]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1047]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1047]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1047]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 994]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 124 locations, 52 error locations. Started 1 CEGAR loops. OverallTime: 681178.9ms, OverallIterations: 30, TraceHistogramMax: 2, EmptinessCheckTime: 22.7ms, AutomataDifference: 298391.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 8.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1765 SDtfs, 4692 SDslu, 6427 SDs, 0 SdLazy, 7897 SolverSat, 509 SolverUnsat, 61 SolverUnknown, 0 SolverNotchecked, 154290.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1457 GetRequests, 945 SyntacticMatches, 64 SemanticMatches, 448 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 2623 ImplicationChecksByTransitivity, 289554.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=170occurred in iteration=29, InterpolantAutomatonStates: 315, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 130.7ms AutomataMinimizationTime, 29 MinimizatonAttempts, 805 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 321.8ms SsaConstructionTime, 1349.9ms SatisfiabilityAnalysisTime, 280917.3ms InterpolantComputationTime, 602 NumberOfCodeBlocks, 602 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1146 ConstructedInterpolants, 142 QuantifiedInterpolants, 14687 SizeOfPredicates, 209 NumberOfNonLiveVariables, 3312 ConjunctsInSsa, 294 ConjunctsInUnsatCore, 58 InterpolantComputations, 54 PerfectInterpolantSequences, 10/14 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 could not prove your program: unable to determine feasibility of some traces [2021-08-27 06:39:39,893 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2021-08-27 06:39:39,929 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 137 Received shutdown request...