./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/lockfree-3.3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 5fbdf5bf Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/lockfree-3.3.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 39b25c4e2cc4769f7c060343bf6a1efac7abb2b9 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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/memsafety/lockfree-3.3.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 39b25c4e2cc4769f7c060343bf6a1efac7abb2b9 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5fbdf5b [2021-08-30 17:03:20,424 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-30 17:03:20,426 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-30 17:03:20,463 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-30 17:03:20,464 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-30 17:03:20,468 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-30 17:03:20,469 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-30 17:03:20,475 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-30 17:03:20,477 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-30 17:03:20,483 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-30 17:03:20,484 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-30 17:03:20,488 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-30 17:03:20,489 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-30 17:03:20,491 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-30 17:03:20,492 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-30 17:03:20,496 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-30 17:03:20,497 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-30 17:03:20,499 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-30 17:03:20,502 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-30 17:03:20,504 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-30 17:03:20,507 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-30 17:03:20,508 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-30 17:03:20,510 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-30 17:03:20,511 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-30 17:03:20,522 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-30 17:03:20,522 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-30 17:03:20,522 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-30 17:03:20,523 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-30 17:03:20,524 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-30 17:03:20,525 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-30 17:03:20,525 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-30 17:03:20,526 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-30 17:03:20,526 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-30 17:03:20,527 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-30 17:03:20,528 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-30 17:03:20,528 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-30 17:03:20,529 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-30 17:03:20,529 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-30 17:03:20,529 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-30 17:03:20,530 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-30 17:03:20,530 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-30 17:03:20,531 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-08-30 17:03:20,551 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-30 17:03:20,551 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-30 17:03:20,552 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-30 17:03:20,552 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-30 17:03:20,553 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-30 17:03:20,553 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-30 17:03:20,554 INFO L138 SettingsManager]: * Use SBE=true [2021-08-30 17:03:20,554 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-30 17:03:20,554 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-30 17:03:20,554 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-30 17:03:20,554 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-30 17:03:20,555 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-30 17:03:20,555 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-30 17:03:20,555 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-08-30 17:03:20,555 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-08-30 17:03:20,555 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-08-30 17:03:20,556 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-30 17:03:20,556 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-08-30 17:03:20,556 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-30 17:03:20,556 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-30 17:03:20,556 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-30 17:03:20,557 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-30 17:03:20,557 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-30 17:03:20,557 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-30 17:03:20,557 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-30 17:03:20,557 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-30 17:03:20,558 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-30 17:03:20,558 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-30 17:03:20,558 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-30 17:03:20,558 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 -> 39b25c4e2cc4769f7c060343bf6a1efac7abb2b9 [2021-08-30 17:03:20,839 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-30 17:03:20,861 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-30 17:03:20,863 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-30 17:03:20,865 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-30 17:03:20,866 INFO L275 PluginConnector]: CDTParser initialized [2021-08-30 17:03:20,868 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/lockfree-3.3.i [2021-08-30 17:03:20,944 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/230d8075e/bfa37d6452b34e28be014e66aaa4217a/FLAG8f86e1867 [2021-08-30 17:03:21,443 INFO L306 CDTParser]: Found 1 translation units. [2021-08-30 17:03:21,444 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/lockfree-3.3.i [2021-08-30 17:03:21,460 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/230d8075e/bfa37d6452b34e28be014e66aaa4217a/FLAG8f86e1867 [2021-08-30 17:03:21,779 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/230d8075e/bfa37d6452b34e28be014e66aaa4217a [2021-08-30 17:03:21,781 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-30 17:03:21,782 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-30 17:03:21,784 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-30 17:03:21,784 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-30 17:03:21,792 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-30 17:03:21,793 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 05:03:21" (1/1) ... [2021-08-30 17:03:21,793 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7be94883 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:03:21, skipping insertion in model container [2021-08-30 17:03:21,794 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 05:03:21" (1/1) ... [2021-08-30 17:03:21,800 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-30 17:03:21,839 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-30 17:03:22,080 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-30 17:03:22,088 INFO L203 MainTranslator]: Completed pre-run [2021-08-30 17:03:22,124 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-30 17:03:22,148 INFO L208 MainTranslator]: Completed translation [2021-08-30 17:03:22,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:03:22 WrapperNode [2021-08-30 17:03:22,149 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-30 17:03:22,150 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-30 17:03:22,150 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-30 17:03:22,151 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-30 17:03:22,160 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:03:22" (1/1) ... [2021-08-30 17:03:22,160 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:03:22" (1/1) ... [2021-08-30 17:03:22,172 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:03:22" (1/1) ... [2021-08-30 17:03:22,172 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:03:22" (1/1) ... [2021-08-30 17:03:22,186 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:03:22" (1/1) ... [2021-08-30 17:03:22,190 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:03:22" (1/1) ... [2021-08-30 17:03:22,198 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:03:22" (1/1) ... [2021-08-30 17:03:22,210 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-30 17:03:22,211 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-30 17:03:22,211 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-30 17:03:22,212 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-30 17:03:22,212 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:03:22" (1/1) ... [2021-08-30 17:03:22,225 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-30 17:03:22,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:03:22,258 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-30 17:03:22,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-30 17:03:22,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-08-30 17:03:22,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-30 17:03:22,293 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-08-30 17:03:22,293 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2021-08-30 17:03:22,294 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2021-08-30 17:03:22,294 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2021-08-30 17:03:22,294 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2021-08-30 17:03:22,294 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2021-08-30 17:03:22,295 INFO L138 BoogieDeclarations]: Found implementation of procedure push [2021-08-30 17:03:22,295 INFO L138 BoogieDeclarations]: Found implementation of procedure pop [2021-08-30 17:03:22,295 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-08-30 17:03:22,296 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-08-30 17:03:22,296 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-08-30 17:03:22,296 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-08-30 17:03:22,296 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-08-30 17:03:22,296 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-08-30 17:03:22,296 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-30 17:03:22,297 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2021-08-30 17:03:22,297 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2021-08-30 17:03:22,297 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2021-08-30 17:03:22,297 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2021-08-30 17:03:22,297 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2021-08-30 17:03:22,297 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2021-08-30 17:03:22,297 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2021-08-30 17:03:22,298 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2021-08-30 17:03:22,298 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2021-08-30 17:03:22,298 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2021-08-30 17:03:22,298 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2021-08-30 17:03:22,298 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2021-08-30 17:03:22,298 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2021-08-30 17:03:22,298 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2021-08-30 17:03:22,299 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2021-08-30 17:03:22,299 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2021-08-30 17:03:22,299 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2021-08-30 17:03:22,299 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2021-08-30 17:03:22,299 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2021-08-30 17:03:22,299 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2021-08-30 17:03:22,300 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2021-08-30 17:03:22,300 INFO L130 BoogieDeclarations]: Found specification of procedure select [2021-08-30 17:03:22,300 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2021-08-30 17:03:22,300 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2021-08-30 17:03:22,300 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2021-08-30 17:03:22,300 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2021-08-30 17:03:22,300 INFO L130 BoogieDeclarations]: Found specification of procedure random [2021-08-30 17:03:22,300 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2021-08-30 17:03:22,301 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2021-08-30 17:03:22,301 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2021-08-30 17:03:22,301 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2021-08-30 17:03:22,301 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2021-08-30 17:03:22,302 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2021-08-30 17:03:22,302 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2021-08-30 17:03:22,302 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2021-08-30 17:03:22,302 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2021-08-30 17:03:22,303 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2021-08-30 17:03:22,303 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2021-08-30 17:03:22,303 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2021-08-30 17:03:22,303 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2021-08-30 17:03:22,303 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2021-08-30 17:03:22,303 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2021-08-30 17:03:22,304 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2021-08-30 17:03:22,304 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2021-08-30 17:03:22,304 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2021-08-30 17:03:22,304 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2021-08-30 17:03:22,304 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2021-08-30 17:03:22,304 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2021-08-30 17:03:22,304 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2021-08-30 17:03:22,305 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2021-08-30 17:03:22,305 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2021-08-30 17:03:22,306 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2021-08-30 17:03:22,306 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2021-08-30 17:03:22,306 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2021-08-30 17:03:22,307 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2021-08-30 17:03:22,307 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-08-30 17:03:22,307 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-08-30 17:03:22,317 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2021-08-30 17:03:22,317 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-08-30 17:03:22,317 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2021-08-30 17:03:22,317 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2021-08-30 17:03:22,317 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2021-08-30 17:03:22,318 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2021-08-30 17:03:22,318 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2021-08-30 17:03:22,318 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2021-08-30 17:03:22,319 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2021-08-30 17:03:22,319 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2021-08-30 17:03:22,319 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2021-08-30 17:03:22,319 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2021-08-30 17:03:22,319 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2021-08-30 17:03:22,319 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2021-08-30 17:03:22,319 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2021-08-30 17:03:22,320 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2021-08-30 17:03:22,320 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2021-08-30 17:03:22,320 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2021-08-30 17:03:22,320 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2021-08-30 17:03:22,320 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2021-08-30 17:03:22,320 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2021-08-30 17:03:22,320 INFO L130 BoogieDeclarations]: Found specification of procedure system [2021-08-30 17:03:22,320 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2021-08-30 17:03:22,321 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2021-08-30 17:03:22,321 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2021-08-30 17:03:22,321 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2021-08-30 17:03:22,321 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2021-08-30 17:03:22,321 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2021-08-30 17:03:22,321 INFO L130 BoogieDeclarations]: Found specification of procedure div [2021-08-30 17:03:22,321 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2021-08-30 17:03:22,321 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2021-08-30 17:03:22,322 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2021-08-30 17:03:22,322 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2021-08-30 17:03:22,322 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2021-08-30 17:03:22,322 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2021-08-30 17:03:22,322 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2021-08-30 17:03:22,322 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2021-08-30 17:03:22,323 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2021-08-30 17:03:22,323 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2021-08-30 17:03:22,323 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2021-08-30 17:03:22,324 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2021-08-30 17:03:22,324 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2021-08-30 17:03:22,324 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2021-08-30 17:03:22,324 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2021-08-30 17:03:22,324 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2021-08-30 17:03:22,324 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2021-08-30 17:03:22,324 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2021-08-30 17:03:22,325 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2021-08-30 17:03:22,325 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2021-08-30 17:03:22,325 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-08-30 17:03:22,325 INFO L130 BoogieDeclarations]: Found specification of procedure push [2021-08-30 17:03:22,325 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-08-30 17:03:22,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-30 17:03:22,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-30 17:03:22,326 INFO L130 BoogieDeclarations]: Found specification of procedure pop [2021-08-30 17:03:22,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-30 17:03:22,328 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-30 17:03:22,329 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-08-30 17:03:22,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-30 17:03:22,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-08-30 17:03:22,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-30 17:03:22,331 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-30 17:03:22,697 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-30 17:03:22,702 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2021-08-30 17:03:22,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 05:03:22 BoogieIcfgContainer [2021-08-30 17:03:22,710 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-30 17:03:22,713 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-30 17:03:22,714 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-30 17:03:22,716 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-30 17:03:22,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 05:03:21" (1/3) ... [2021-08-30 17:03:22,718 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12049e9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 05:03:22, skipping insertion in model container [2021-08-30 17:03:22,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:03:22" (2/3) ... [2021-08-30 17:03:22,718 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12049e9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 05:03:22, skipping insertion in model container [2021-08-30 17:03:22,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 05:03:22" (3/3) ... [2021-08-30 17:03:22,720 INFO L111 eAbstractionObserver]: Analyzing ICFG lockfree-3.3.i [2021-08-30 17:03:22,725 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-30 17:03:22,725 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2021-08-30 17:03:22,772 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-30 17:03:22,780 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-30 17:03:22,781 INFO L340 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2021-08-30 17:03:22,820 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 45 states have (on average 1.8888888888888888) internal successors, (85), 67 states have internal predecessors, (85), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2021-08-30 17:03:22,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-08-30 17:03:22,832 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:03:22,833 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:03:22,833 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0REQUIRES_VIOLATION === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-30 17:03:22,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:03:22,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1846299228, now seen corresponding path program 1 times [2021-08-30 17:03:22,848 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:03:22,849 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302471101] [2021-08-30 17:03:22,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:03:22,850 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:03:22,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:03:23,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:03:23,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:03:23,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 17:03:23,180 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:03:23,180 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302471101] [2021-08-30 17:03:23,181 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302471101] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 17:03:23,181 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-30 17:03:23,181 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-30 17:03:23,183 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765048143] [2021-08-30 17:03:23,186 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-30 17:03:23,187 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:03:23,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-30 17:03:23,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-30 17:03:23,210 INFO L87 Difference]: Start difference. First operand has 74 states, 45 states have (on average 1.8888888888888888) internal successors, (85), 67 states have internal predecessors, (85), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 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-30 17:03:23,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:03:23,423 INFO L93 Difference]: Finished difference Result 92 states and 115 transitions. [2021-08-30 17:03:23,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-30 17:03:23,425 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 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 8 [2021-08-30 17:03:23,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:03:23,433 INFO L225 Difference]: With dead ends: 92 [2021-08-30 17:03:23,433 INFO L226 Difference]: Without dead ends: 89 [2021-08-30 17:03:23,435 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 92.35ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-30 17:03:23,438 INFO L928 BasicCegarLoop]: 10 mSDtfsCounter, 18 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 151.77ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.52ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 182.15ms IncrementalHoareTripleChecker+Time [2021-08-30 17:03:23,444 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 14 Invalid, 173 Unknown, 0 Unchecked, 3.52ms Time], IncrementalHoareTripleChecker [5 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 182.15ms Time] [2021-08-30 17:03:23,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-08-30 17:03:23,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 71. [2021-08-30 17:03:23,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 44 states have (on average 1.8409090909090908) internal successors, (81), 65 states have internal predecessors, (81), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-30 17:03:23,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 88 transitions. [2021-08-30 17:03:23,479 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 88 transitions. Word has length 8 [2021-08-30 17:03:23,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:03:23,480 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 88 transitions. [2021-08-30 17:03:23,480 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 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-30 17:03:23,480 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 88 transitions. [2021-08-30 17:03:23,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-08-30 17:03:23,481 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:03:23,481 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:03:23,481 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-30 17:03:23,481 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0REQUIRES_VIOLATION === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-30 17:03:23,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:03:23,482 INFO L82 PathProgramCache]: Analyzing trace with hash 451849005, now seen corresponding path program 1 times [2021-08-30 17:03:23,483 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:03:23,483 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351689343] [2021-08-30 17:03:23,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:03:23,483 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:03:23,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:03:23,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:03:23,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:03:23,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 17:03:23,608 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:03:23,608 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351689343] [2021-08-30 17:03:23,609 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351689343] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 17:03:23,609 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-30 17:03:23,609 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-30 17:03:23,609 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528156320] [2021-08-30 17:03:23,613 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-30 17:03:23,615 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:03:23,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-30 17:03:23,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-30 17:03:23,616 INFO L87 Difference]: Start difference. First operand 71 states and 88 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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-30 17:03:23,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:03:23,914 INFO L93 Difference]: Finished difference Result 91 states and 114 transitions. [2021-08-30 17:03:23,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-30 17:03:23,915 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 10 [2021-08-30 17:03:23,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:03:23,918 INFO L225 Difference]: With dead ends: 91 [2021-08-30 17:03:23,918 INFO L226 Difference]: Without dead ends: 91 [2021-08-30 17:03:23,919 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 107.09ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-30 17:03:23,923 INFO L928 BasicCegarLoop]: 9 mSDtfsCounter, 18 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 167.25ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.91ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 208.83ms IncrementalHoareTripleChecker+Time [2021-08-30 17:03:23,924 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 21 Invalid, 250 Unknown, 0 Unchecked, 6.91ms Time], IncrementalHoareTripleChecker [6 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 208.83ms Time] [2021-08-30 17:03:23,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2021-08-30 17:03:23,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 72. [2021-08-30 17:03:23,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 45 states have (on average 1.8222222222222222) internal successors, (82), 66 states have internal predecessors, (82), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-30 17:03:23,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 89 transitions. [2021-08-30 17:03:23,941 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 89 transitions. Word has length 10 [2021-08-30 17:03:23,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:03:23,942 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 89 transitions. [2021-08-30 17:03:23,942 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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-30 17:03:23,942 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 89 transitions. [2021-08-30 17:03:23,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-08-30 17:03:23,943 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:03:23,943 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:03:23,943 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-30 17:03:23,943 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0REQUIRES_VIOLATION === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-30 17:03:23,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:03:23,945 INFO L82 PathProgramCache]: Analyzing trace with hash 451908587, now seen corresponding path program 1 times [2021-08-30 17:03:23,945 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:03:23,945 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849624596] [2021-08-30 17:03:23,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:03:23,946 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:03:23,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:03:24,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:03:24,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:03:24,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 17:03:24,129 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:03:24,129 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849624596] [2021-08-30 17:03:24,129 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849624596] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 17:03:24,130 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-30 17:03:24,130 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-30 17:03:24,130 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503629764] [2021-08-30 17:03:24,131 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-30 17:03:24,132 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:03:24,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-30 17:03:24,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-30 17:03:24,133 INFO L87 Difference]: Start difference. First operand 72 states and 89 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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-30 17:03:24,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:03:24,481 INFO L93 Difference]: Finished difference Result 135 states and 176 transitions. [2021-08-30 17:03:24,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-30 17:03:24,482 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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) Word has length 10 [2021-08-30 17:03:24,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:03:24,483 INFO L225 Difference]: With dead ends: 135 [2021-08-30 17:03:24,483 INFO L226 Difference]: Without dead ends: 135 [2021-08-30 17:03:24,484 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 115.90ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-30 17:03:24,485 INFO L928 BasicCegarLoop]: 10 mSDtfsCounter, 81 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 220.06ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.61ms SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 265.51ms IncrementalHoareTripleChecker+Time [2021-08-30 17:03:24,485 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 19 Invalid, 257 Unknown, 0 Unchecked, 3.61ms Time], IncrementalHoareTripleChecker [13 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 265.51ms Time] [2021-08-30 17:03:24,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2021-08-30 17:03:24,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 108. [2021-08-30 17:03:24,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 77 states have (on average 1.8311688311688312) internal successors, (141), 99 states have internal predecessors, (141), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2021-08-30 17:03:24,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 153 transitions. [2021-08-30 17:03:24,510 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 153 transitions. Word has length 10 [2021-08-30 17:03:24,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:03:24,510 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 153 transitions. [2021-08-30 17:03:24,511 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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-30 17:03:24,511 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 153 transitions. [2021-08-30 17:03:24,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-08-30 17:03:24,511 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:03:24,511 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:03:24,512 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-30 17:03:24,512 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr5ENSURES_VIOLATIONMEMORY_LEAK === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-30 17:03:24,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:03:24,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1124262917, now seen corresponding path program 1 times [2021-08-30 17:03:24,513 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:03:24,513 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974869544] [2021-08-30 17:03:24,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:03:24,514 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:03:24,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:03:24,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:03:24,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:03:24,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 17:03:24,626 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:03:24,626 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974869544] [2021-08-30 17:03:24,626 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974869544] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 17:03:24,626 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-30 17:03:24,626 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-30 17:03:24,627 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195626293] [2021-08-30 17:03:24,627 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-30 17:03:24,627 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:03:24,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-30 17:03:24,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-30 17:03:24,628 INFO L87 Difference]: Start difference. First operand 108 states and 153 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-30 17:03:24,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:03:24,870 INFO L93 Difference]: Finished difference Result 149 states and 214 transitions. [2021-08-30 17:03:24,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-30 17:03:24,871 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 11 [2021-08-30 17:03:24,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:03:24,872 INFO L225 Difference]: With dead ends: 149 [2021-08-30 17:03:24,872 INFO L226 Difference]: Without dead ends: 144 [2021-08-30 17:03:24,873 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 46.53ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-30 17:03:24,874 INFO L928 BasicCegarLoop]: 7 mSDtfsCounter, 75 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 186.82ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.00ms SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 231.91ms IncrementalHoareTripleChecker+Time [2021-08-30 17:03:24,874 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 8 Invalid, 213 Unknown, 0 Unchecked, 2.00ms Time], IncrementalHoareTripleChecker [19 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 231.91ms Time] [2021-08-30 17:03:24,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2021-08-30 17:03:24,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 126. [2021-08-30 17:03:24,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 89 states have (on average 1.7752808988764044) internal successors, (158), 115 states have internal predecessors, (158), 10 states have call successors, (10), 6 states have call predecessors, (10), 7 states have return successors, (15), 5 states have call predecessors, (15), 9 states have call successors, (15) [2021-08-30 17:03:24,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 183 transitions. [2021-08-30 17:03:24,883 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 183 transitions. Word has length 11 [2021-08-30 17:03:24,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:03:24,883 INFO L470 AbstractCegarLoop]: Abstraction has 126 states and 183 transitions. [2021-08-30 17:03:24,883 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-30 17:03:24,883 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 183 transitions. [2021-08-30 17:03:24,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-30 17:03:24,884 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:03:24,884 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:03:24,884 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-30 17:03:24,884 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting pushErr0REQUIRES_VIOLATION === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-30 17:03:24,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:03:24,885 INFO L82 PathProgramCache]: Analyzing trace with hash 649350680, now seen corresponding path program 1 times [2021-08-30 17:03:24,885 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:03:24,885 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758109861] [2021-08-30 17:03:24,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:03:24,886 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:03:24,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:03:24,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:03:24,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:03:24,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 17:03:25,000 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:03:25,000 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758109861] [2021-08-30 17:03:25,000 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758109861] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 17:03:25,000 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-30 17:03:25,000 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-30 17:03:25,000 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841737010] [2021-08-30 17:03:25,001 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-30 17:03:25,001 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:03:25,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-30 17:03:25,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-30 17:03:25,002 INFO L87 Difference]: Start difference. First operand 126 states and 183 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-30 17:03:25,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:03:25,403 INFO L93 Difference]: Finished difference Result 197 states and 286 transitions. [2021-08-30 17:03:25,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-30 17:03:25,406 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2021-08-30 17:03:25,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:03:25,407 INFO L225 Difference]: With dead ends: 197 [2021-08-30 17:03:25,407 INFO L226 Difference]: Without dead ends: 197 [2021-08-30 17:03:25,407 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 191.99ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-30 17:03:25,408 INFO L928 BasicCegarLoop]: 10 mSDtfsCounter, 57 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 204.90ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.01ms SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 247.60ms IncrementalHoareTripleChecker+Time [2021-08-30 17:03:25,408 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 30 Invalid, 356 Unknown, 0 Unchecked, 3.01ms Time], IncrementalHoareTripleChecker [14 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 247.60ms Time] [2021-08-30 17:03:25,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2021-08-30 17:03:25,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 166. [2021-08-30 17:03:25,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 125 states have (on average 1.752) internal successors, (219), 151 states have internal predecessors, (219), 12 states have call successors, (12), 8 states have call predecessors, (12), 9 states have return successors, (20), 7 states have call predecessors, (20), 11 states have call successors, (20) [2021-08-30 17:03:25,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 251 transitions. [2021-08-30 17:03:25,430 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 251 transitions. Word has length 13 [2021-08-30 17:03:25,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:03:25,430 INFO L470 AbstractCegarLoop]: Abstraction has 166 states and 251 transitions. [2021-08-30 17:03:25,431 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-30 17:03:25,431 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 251 transitions. [2021-08-30 17:03:25,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-30 17:03:25,431 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:03:25,432 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:03:25,432 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-30 17:03:25,432 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting pushErr0REQUIRES_VIOLATION === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-30 17:03:25,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:03:25,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1870609254, now seen corresponding path program 1 times [2021-08-30 17:03:25,433 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:03:25,433 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595287484] [2021-08-30 17:03:25,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:03:25,433 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:03:25,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:03:25,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:03:25,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:03:25,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 17:03:25,545 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:03:25,545 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595287484] [2021-08-30 17:03:25,545 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595287484] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 17:03:25,545 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-30 17:03:25,545 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-30 17:03:25,545 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997558342] [2021-08-30 17:03:25,546 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-30 17:03:25,546 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:03:25,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-30 17:03:25,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-30 17:03:25,547 INFO L87 Difference]: Start difference. First operand 166 states and 251 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-30 17:03:25,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:03:25,868 INFO L93 Difference]: Finished difference Result 260 states and 393 transitions. [2021-08-30 17:03:25,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-30 17:03:25,869 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2021-08-30 17:03:25,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:03:25,871 INFO L225 Difference]: With dead ends: 260 [2021-08-30 17:03:25,871 INFO L226 Difference]: Without dead ends: 260 [2021-08-30 17:03:25,871 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 90.02ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-30 17:03:25,872 INFO L928 BasicCegarLoop]: 13 mSDtfsCounter, 78 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 216.41ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.13ms SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 264.14ms IncrementalHoareTripleChecker+Time [2021-08-30 17:03:25,872 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 21 Invalid, 381 Unknown, 0 Unchecked, 3.13ms Time], IncrementalHoareTripleChecker [12 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 264.14ms Time] [2021-08-30 17:03:25,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2021-08-30 17:03:25,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 233. [2021-08-30 17:03:25,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 186 states have (on average 1.7258064516129032) internal successors, (321), 212 states have internal predecessors, (321), 16 states have call successors, (16), 12 states have call predecessors, (16), 13 states have return successors, (29), 9 states have call predecessors, (29), 15 states have call successors, (29) [2021-08-30 17:03:25,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 366 transitions. [2021-08-30 17:03:25,884 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 366 transitions. Word has length 13 [2021-08-30 17:03:25,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:03:25,885 INFO L470 AbstractCegarLoop]: Abstraction has 233 states and 366 transitions. [2021-08-30 17:03:25,885 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-30 17:03:25,885 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 366 transitions. [2021-08-30 17:03:25,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-30 17:03:25,885 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:03:25,886 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:03:25,886 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-30 17:03:25,886 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting pushErr1REQUIRES_VIOLATION === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-30 17:03:25,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:03:25,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1870609253, now seen corresponding path program 1 times [2021-08-30 17:03:25,887 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:03:25,887 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118030098] [2021-08-30 17:03:25,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:03:25,887 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:03:25,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:03:25,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:03:25,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:03:25,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 17:03:25,968 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:03:25,969 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118030098] [2021-08-30 17:03:25,969 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118030098] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 17:03:25,969 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-30 17:03:25,969 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-30 17:03:25,969 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609758771] [2021-08-30 17:03:25,970 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-30 17:03:25,970 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:03:25,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-30 17:03:25,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-30 17:03:25,970 INFO L87 Difference]: Start difference. First operand 233 states and 366 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-30 17:03:26,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:03:26,314 INFO L93 Difference]: Finished difference Result 311 states and 476 transitions. [2021-08-30 17:03:26,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-30 17:03:26,314 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2021-08-30 17:03:26,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:03:26,318 INFO L225 Difference]: With dead ends: 311 [2021-08-30 17:03:26,318 INFO L226 Difference]: Without dead ends: 311 [2021-08-30 17:03:26,319 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 85.13ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-30 17:03:26,320 INFO L928 BasicCegarLoop]: 15 mSDtfsCounter, 77 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 230.02ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.18ms SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 277.85ms IncrementalHoareTripleChecker+Time [2021-08-30 17:03:26,320 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 24 Invalid, 377 Unknown, 0 Unchecked, 2.18ms Time], IncrementalHoareTripleChecker [10 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 277.85ms Time] [2021-08-30 17:03:26,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2021-08-30 17:03:26,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 287. [2021-08-30 17:03:26,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 238 states have (on average 1.7016806722689075) internal successors, (405), 262 states have internal predecessors, (405), 16 states have call successors, (16), 16 states have call predecessors, (16), 17 states have return successors, (29), 9 states have call predecessors, (29), 15 states have call successors, (29) [2021-08-30 17:03:26,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 450 transitions. [2021-08-30 17:03:26,341 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 450 transitions. Word has length 13 [2021-08-30 17:03:26,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:03:26,341 INFO L470 AbstractCegarLoop]: Abstraction has 287 states and 450 transitions. [2021-08-30 17:03:26,341 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-30 17:03:26,341 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 450 transitions. [2021-08-30 17:03:26,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-08-30 17:03:26,342 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:03:26,342 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:03:26,342 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-30 17:03:26,342 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting pushErr4REQUIRES_VIOLATION === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-30 17:03:26,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:03:26,343 INFO L82 PathProgramCache]: Analyzing trace with hash 2140662271, now seen corresponding path program 1 times [2021-08-30 17:03:26,343 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:03:26,343 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111058415] [2021-08-30 17:03:26,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:03:26,344 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:03:26,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:03:26,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:03:26,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:03:26,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 17:03:26,454 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:03:26,454 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111058415] [2021-08-30 17:03:26,455 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111058415] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 17:03:26,455 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-30 17:03:26,455 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-30 17:03:26,455 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082838134] [2021-08-30 17:03:26,456 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-30 17:03:26,456 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:03:26,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-30 17:03:26,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-30 17:03:26,458 INFO L87 Difference]: Start difference. First operand 287 states and 450 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-30 17:03:26,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:03:26,750 INFO L93 Difference]: Finished difference Result 275 states and 400 transitions. [2021-08-30 17:03:26,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-30 17:03:26,752 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2021-08-30 17:03:26,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:03:26,753 INFO L225 Difference]: With dead ends: 275 [2021-08-30 17:03:26,753 INFO L226 Difference]: Without dead ends: 275 [2021-08-30 17:03:26,754 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 82.33ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-30 17:03:26,754 INFO L928 BasicCegarLoop]: 11 mSDtfsCounter, 63 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 191.26ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.99ms SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 238.71ms IncrementalHoareTripleChecker+Time [2021-08-30 17:03:26,755 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 32 Invalid, 318 Unknown, 0 Unchecked, 1.99ms Time], IncrementalHoareTripleChecker [17 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 238.71ms Time] [2021-08-30 17:03:26,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2021-08-30 17:03:26,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 238. [2021-08-30 17:03:26,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 197 states have (on average 1.649746192893401) internal successors, (325), 215 states have internal predecessors, (325), 14 states have call successors, (14), 14 states have call predecessors, (14), 15 states have return successors, (23), 9 states have call predecessors, (23), 13 states have call successors, (23) [2021-08-30 17:03:26,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 362 transitions. [2021-08-30 17:03:26,763 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 362 transitions. Word has length 14 [2021-08-30 17:03:26,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:03:26,763 INFO L470 AbstractCegarLoop]: Abstraction has 238 states and 362 transitions. [2021-08-30 17:03:26,763 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-30 17:03:26,764 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 362 transitions. [2021-08-30 17:03:26,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-30 17:03:26,764 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:03:26,764 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:03:26,764 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-30 17:03:26,765 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting popErr0REQUIRES_VIOLATION === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-30 17:03:26,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:03:26,765 INFO L82 PathProgramCache]: Analyzing trace with hash 406451957, now seen corresponding path program 1 times [2021-08-30 17:03:26,765 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:03:26,765 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918094086] [2021-08-30 17:03:26,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:03:26,766 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:03:26,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:03:26,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:03:26,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:03:26,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-30 17:03:26,846 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:03:26,846 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918094086] [2021-08-30 17:03:26,846 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918094086] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 17:03:26,846 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-30 17:03:26,847 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-30 17:03:26,847 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129576462] [2021-08-30 17:03:26,847 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-30 17:03:26,847 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:03:26,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-30 17:03:26,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-30 17:03:26,848 INFO L87 Difference]: Start difference. First operand 238 states and 362 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-30 17:03:27,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:03:27,154 INFO L93 Difference]: Finished difference Result 439 states and 619 transitions. [2021-08-30 17:03:27,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-30 17:03:27,156 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2021-08-30 17:03:27,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:03:27,158 INFO L225 Difference]: With dead ends: 439 [2021-08-30 17:03:27,158 INFO L226 Difference]: Without dead ends: 439 [2021-08-30 17:03:27,159 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 81.31ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-08-30 17:03:27,159 INFO L928 BasicCegarLoop]: 10 mSDtfsCounter, 52 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 194.98ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.28ms SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 250.51ms IncrementalHoareTripleChecker+Time [2021-08-30 17:03:27,159 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 39 Invalid, 396 Unknown, 0 Unchecked, 2.28ms Time], IncrementalHoareTripleChecker [20 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 250.51ms Time] [2021-08-30 17:03:27,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2021-08-30 17:03:27,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 409. [2021-08-30 17:03:27,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 334 states have (on average 1.5089820359281436) internal successors, (504), 366 states have internal predecessors, (504), 26 states have call successors, (26), 26 states have call predecessors, (26), 37 states have return successors, (55), 17 states have call predecessors, (55), 25 states have call successors, (55) [2021-08-30 17:03:27,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 585 transitions. [2021-08-30 17:03:27,173 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 585 transitions. Word has length 15 [2021-08-30 17:03:27,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:03:27,174 INFO L470 AbstractCegarLoop]: Abstraction has 409 states and 585 transitions. [2021-08-30 17:03:27,174 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-30 17:03:27,174 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 585 transitions. [2021-08-30 17:03:27,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-08-30 17:03:27,175 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:03:27,175 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:03:27,175 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-30 17:03:27,175 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr5ENSURES_VIOLATIONMEMORY_LEAK === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-30 17:03:27,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:03:27,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1475656894, now seen corresponding path program 1 times [2021-08-30 17:03:27,176 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:03:27,176 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231886598] [2021-08-30 17:03:27,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:03:27,176 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:03:27,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:03:27,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:03:27,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:03:27,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-30 17:03:27,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:03:27,306 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 17:03:27,306 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:03:27,306 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231886598] [2021-08-30 17:03:27,306 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231886598] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:03:27,306 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [863672760] [2021-08-30 17:03:27,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:03:27,307 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:03:27,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:03:27,313 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:03:27,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-08-30 17:03:27,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:03:27,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 9 conjunts are in the unsatisfiable core [2021-08-30 17:03:27,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:03:27,620 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 17:03:27,620 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:03:27,805 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 17:03:27,806 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [863672760] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:03:27,806 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:03:27,806 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2021-08-30 17:03:27,806 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393912630] [2021-08-30 17:03:27,807 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-08-30 17:03:27,807 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:03:27,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-30 17:03:27,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2021-08-30 17:03:27,808 INFO L87 Difference]: Start difference. First operand 409 states and 585 transitions. Second operand has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2021-08-30 17:03:28,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:03:28,669 INFO L93 Difference]: Finished difference Result 491 states and 695 transitions. [2021-08-30 17:03:28,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-30 17:03:28,670 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 22 [2021-08-30 17:03:28,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:03:28,672 INFO L225 Difference]: With dead ends: 491 [2021-08-30 17:03:28,672 INFO L226 Difference]: Without dead ends: 491 [2021-08-30 17:03:28,673 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 427.78ms TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2021-08-30 17:03:28,673 INFO L928 BasicCegarLoop]: 9 mSDtfsCounter, 413 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 451.37ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.86ms SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 547.11ms IncrementalHoareTripleChecker+Time [2021-08-30 17:03:28,673 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [417 Valid, 20 Invalid, 960 Unknown, 0 Unchecked, 7.86ms Time], IncrementalHoareTripleChecker [149 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 547.11ms Time] [2021-08-30 17:03:28,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2021-08-30 17:03:28,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 425. [2021-08-30 17:03:28,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 340 states have (on average 1.4764705882352942) internal successors, (502), 382 states have internal predecessors, (502), 26 states have call successors, (26), 26 states have call predecessors, (26), 47 states have return successors, (65), 17 states have call predecessors, (65), 25 states have call successors, (65) [2021-08-30 17:03:28,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 593 transitions. [2021-08-30 17:03:28,691 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 593 transitions. Word has length 22 [2021-08-30 17:03:28,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:03:28,692 INFO L470 AbstractCegarLoop]: Abstraction has 425 states and 593 transitions. [2021-08-30 17:03:28,692 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2021-08-30 17:03:28,692 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 593 transitions. [2021-08-30 17:03:28,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-30 17:03:28,692 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:03:28,693 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:03:28,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-08-30 17:03:28,921 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,SelfDestructingSolverStorable9 [2021-08-30 17:03:28,924 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting popErr0REQUIRES_VIOLATION === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-30 17:03:28,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:03:28,924 INFO L82 PathProgramCache]: Analyzing trace with hash -2086418946, now seen corresponding path program 1 times [2021-08-30 17:03:28,924 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:03:28,924 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092567499] [2021-08-30 17:03:28,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:03:28,925 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:03:28,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:03:29,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:03:29,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:03:29,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-30 17:03:29,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:03:29,103 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 17:03:29,103 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:03:29,103 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092567499] [2021-08-30 17:03:29,103 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092567499] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:03:29,104 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801999955] [2021-08-30 17:03:29,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:03:29,104 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:03:29,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:03:29,109 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:03:29,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-08-30 17:03:29,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:03:29,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 13 conjunts are in the unsatisfiable core [2021-08-30 17:03:29,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:03:29,382 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 17:03:29,383 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:03:29,535 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 17:03:29,536 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [801999955] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:03:29,536 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:03:29,536 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2021-08-30 17:03:29,536 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967421190] [2021-08-30 17:03:29,537 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-30 17:03:29,537 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:03:29,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-30 17:03:29,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2021-08-30 17:03:29,538 INFO L87 Difference]: Start difference. First operand 425 states and 593 transitions. Second operand has 15 states, 15 states have (on average 2.2) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (8), 8 states have call predecessors, (8), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2021-08-30 17:03:30,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:03:30,437 INFO L93 Difference]: Finished difference Result 739 states and 1008 transitions. [2021-08-30 17:03:30,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-08-30 17:03:30,438 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (8), 8 states have call predecessors, (8), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 24 [2021-08-30 17:03:30,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:03:30,441 INFO L225 Difference]: With dead ends: 739 [2021-08-30 17:03:30,441 INFO L226 Difference]: Without dead ends: 739 [2021-08-30 17:03:30,442 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 439.76ms TimeCoverageRelationStatistics Valid=231, Invalid=699, Unknown=0, NotChecked=0, Total=930 [2021-08-30 17:03:30,442 INFO L928 BasicCegarLoop]: 12 mSDtfsCounter, 480 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 447.50ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.67ms SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 549.64ms IncrementalHoareTripleChecker+Time [2021-08-30 17:03:30,442 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [482 Valid, 40 Invalid, 878 Unknown, 0 Unchecked, 8.67ms Time], IncrementalHoareTripleChecker [191 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 549.64ms Time] [2021-08-30 17:03:30,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2021-08-30 17:03:30,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 642. [2021-08-30 17:03:30,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 507 states have (on average 1.4260355029585798) internal successors, (723), 579 states have internal predecessors, (723), 38 states have call successors, (38), 38 states have call predecessors, (38), 85 states have return successors, (113), 25 states have call predecessors, (113), 37 states have call successors, (113) [2021-08-30 17:03:30,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 874 transitions. [2021-08-30 17:03:30,462 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 874 transitions. Word has length 24 [2021-08-30 17:03:30,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:03:30,462 INFO L470 AbstractCegarLoop]: Abstraction has 642 states and 874 transitions. [2021-08-30 17:03:30,463 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.2) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (8), 8 states have call predecessors, (8), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2021-08-30 17:03:30,463 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 874 transitions. [2021-08-30 17:03:30,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-08-30 17:03:30,464 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:03:30,464 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:03:30,493 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-30 17:03:30,688 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,SelfDestructingSolverStorable10 [2021-08-30 17:03:30,689 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting popErr0REQUIRES_VIOLATION === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-30 17:03:30,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:03:30,689 INFO L82 PathProgramCache]: Analyzing trace with hash -495871717, now seen corresponding path program 1 times [2021-08-30 17:03:30,689 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:03:30,689 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112373370] [2021-08-30 17:03:30,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:03:30,690 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:03:30,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:03:30,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:03:30,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:03:30,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-30 17:03:30,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:03:30,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-30 17:03:30,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:03:30,880 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 15 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-30 17:03:30,881 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:03:30,881 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112373370] [2021-08-30 17:03:30,881 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112373370] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:03:30,881 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [850051322] [2021-08-30 17:03:30,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:03:30,881 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:03:30,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:03:30,882 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:03:30,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-08-30 17:03:31,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:03:31,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 15 conjunts are in the unsatisfiable core [2021-08-30 17:03:31,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:03:31,179 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 22 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 17:03:31,179 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:03:31,403 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 22 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 17:03:31,403 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [850051322] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:03:31,403 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:03:31,403 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 15 [2021-08-30 17:03:31,404 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313532157] [2021-08-30 17:03:31,404 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-30 17:03:31,404 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:03:31,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-30 17:03:31,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2021-08-30 17:03:31,405 INFO L87 Difference]: Start difference. First operand 642 states and 874 transitions. Second operand has 15 states, 15 states have (on average 3.2) internal successors, (48), 13 states have internal predecessors, (48), 4 states have call successors, (10), 7 states have call predecessors, (10), 7 states have return successors, (7), 6 states have call predecessors, (7), 3 states have call successors, (7) [2021-08-30 17:03:32,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:03:32,931 INFO L93 Difference]: Finished difference Result 2361 states and 3365 transitions. [2021-08-30 17:03:32,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-08-30 17:03:32,932 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 13 states have internal predecessors, (48), 4 states have call successors, (10), 7 states have call predecessors, (10), 7 states have return successors, (7), 6 states have call predecessors, (7), 3 states have call successors, (7) Word has length 35 [2021-08-30 17:03:32,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:03:32,942 INFO L225 Difference]: With dead ends: 2361 [2021-08-30 17:03:32,942 INFO L226 Difference]: Without dead ends: 2361 [2021-08-30 17:03:32,943 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 782.31ms TimeCoverageRelationStatistics Valid=272, Invalid=850, Unknown=0, NotChecked=0, Total=1122 [2021-08-30 17:03:32,943 INFO L928 BasicCegarLoop]: 13 mSDtfsCounter, 970 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 1191 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 687.34ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 972 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 1446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 12.29ms SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 1191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 834.58ms IncrementalHoareTripleChecker+Time [2021-08-30 17:03:32,944 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [972 Valid, 32 Invalid, 1446 Unknown, 0 Unchecked, 12.29ms Time], IncrementalHoareTripleChecker [255 Valid, 1191 Invalid, 0 Unknown, 0 Unchecked, 834.58ms Time] [2021-08-30 17:03:32,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2361 states. [2021-08-30 17:03:32,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2361 to 2015. [2021-08-30 17:03:33,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2015 states, 1621 states have (on average 1.4090067859346083) internal successors, (2284), 1816 states have internal predecessors, (2284), 123 states have call successors, (123), 123 states have call predecessors, (123), 259 states have return successors, (388), 76 states have call predecessors, (388), 122 states have call successors, (388) [2021-08-30 17:03:33,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2015 states to 2015 states and 2795 transitions. [2021-08-30 17:03:33,010 INFO L78 Accepts]: Start accepts. Automaton has 2015 states and 2795 transitions. Word has length 35 [2021-08-30 17:03:33,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:03:33,010 INFO L470 AbstractCegarLoop]: Abstraction has 2015 states and 2795 transitions. [2021-08-30 17:03:33,010 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 13 states have internal predecessors, (48), 4 states have call successors, (10), 7 states have call predecessors, (10), 7 states have return successors, (7), 6 states have call predecessors, (7), 3 states have call successors, (7) [2021-08-30 17:03:33,011 INFO L276 IsEmpty]: Start isEmpty. Operand 2015 states and 2795 transitions. [2021-08-30 17:03:33,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-08-30 17:03:33,012 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:03:33,012 INFO L513 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:03:33,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-08-30 17:03:33,225 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:03:33,225 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr5ENSURES_VIOLATIONMEMORY_LEAK === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-30 17:03:33,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:03:33,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1356372979, now seen corresponding path program 1 times [2021-08-30 17:03:33,226 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:03:33,226 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463359921] [2021-08-30 17:03:33,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:03:33,226 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:03:33,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:03:33,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:03:33,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:03:33,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-30 17:03:33,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:03:33,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-30 17:03:33,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:03:33,379 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-30 17:03:33,379 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:03:33,379 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463359921] [2021-08-30 17:03:33,379 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463359921] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:03:33,379 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [479648470] [2021-08-30 17:03:33,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:03:33,380 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:03:33,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:03:33,381 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:03:33,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-08-30 17:03:33,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:03:33,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 13 conjunts are in the unsatisfiable core [2021-08-30 17:03:33,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:03:33,660 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-30 17:03:33,661 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:03:33,927 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 17:03:33,928 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [479648470] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:03:33,928 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:03:33,928 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 20 [2021-08-30 17:03:33,928 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480700000] [2021-08-30 17:03:33,929 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-08-30 17:03:33,929 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:03:33,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-08-30 17:03:33,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2021-08-30 17:03:33,930 INFO L87 Difference]: Start difference. First operand 2015 states and 2795 transitions. Second operand has 20 states, 20 states have (on average 3.35) internal successors, (67), 14 states have internal predecessors, (67), 6 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2021-08-30 17:03:35,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:03:35,494 INFO L93 Difference]: Finished difference Result 4443 states and 6449 transitions. [2021-08-30 17:03:35,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-08-30 17:03:35,495 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.35) internal successors, (67), 14 states have internal predecessors, (67), 6 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 36 [2021-08-30 17:03:35,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:03:35,517 INFO L225 Difference]: With dead ends: 4443 [2021-08-30 17:03:35,518 INFO L226 Difference]: Without dead ends: 4443 [2021-08-30 17:03:35,519 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 598 ImplicationChecksByTransitivity, 851.52ms TimeCoverageRelationStatistics Valid=589, Invalid=1961, Unknown=0, NotChecked=0, Total=2550 [2021-08-30 17:03:35,519 INFO L928 BasicCegarLoop]: 8 mSDtfsCounter, 696 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 1086 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 668.46ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 704 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 1309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 10.23ms SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 1086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 807.76ms IncrementalHoareTripleChecker+Time [2021-08-30 17:03:35,519 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [704 Valid, 24 Invalid, 1309 Unknown, 0 Unchecked, 10.23ms Time], IncrementalHoareTripleChecker [223 Valid, 1086 Invalid, 0 Unknown, 0 Unchecked, 807.76ms Time] [2021-08-30 17:03:35,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4443 states. [2021-08-30 17:03:35,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4443 to 4074. [2021-08-30 17:03:35,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4074 states, 3286 states have (on average 1.4184418746195984) internal successors, (4661), 3691 states have internal predecessors, (4661), 261 states have call successors, (261), 238 states have call predecessors, (261), 515 states have return successors, (915), 145 states have call predecessors, (915), 260 states have call successors, (915) [2021-08-30 17:03:35,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4074 states to 4074 states and 5837 transitions. [2021-08-30 17:03:35,680 INFO L78 Accepts]: Start accepts. Automaton has 4074 states and 5837 transitions. Word has length 36 [2021-08-30 17:03:35,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:03:35,680 INFO L470 AbstractCegarLoop]: Abstraction has 4074 states and 5837 transitions. [2021-08-30 17:03:35,680 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.35) internal successors, (67), 14 states have internal predecessors, (67), 6 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2021-08-30 17:03:35,680 INFO L276 IsEmpty]: Start isEmpty. Operand 4074 states and 5837 transitions. [2021-08-30 17:03:35,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-08-30 17:03:35,684 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:03:35,684 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:03:35,726 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-08-30 17:03:35,884 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:03:35,885 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting popErr0REQUIRES_VIOLATION === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-30 17:03:35,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:03:35,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1744987825, now seen corresponding path program 1 times [2021-08-30 17:03:35,885 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:03:35,885 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676705304] [2021-08-30 17:03:35,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:03:35,885 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:03:35,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:03:35,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:03:35,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:03:35,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-30 17:03:35,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:03:36,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-30 17:03:36,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:03:36,089 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-30 17:03:36,090 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:03:36,090 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676705304] [2021-08-30 17:03:36,090 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676705304] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:03:36,090 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175861668] [2021-08-30 17:03:36,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:03:36,090 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:03:36,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:03:36,097 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:03:36,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-08-30 17:03:36,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:03:36,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 22 conjunts are in the unsatisfiable core [2021-08-30 17:03:36,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:03:36,379 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-30 17:03:36,379 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:03:36,655 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 17:03:36,655 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [175861668] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:03:36,656 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:03:36,656 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 18 [2021-08-30 17:03:36,656 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625458706] [2021-08-30 17:03:36,657 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-08-30 17:03:36,657 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:03:36,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-08-30 17:03:36,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2021-08-30 17:03:36,658 INFO L87 Difference]: Start difference. First operand 4074 states and 5837 transitions. Second operand has 18 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 12 states have internal predecessors, (44), 4 states have call successors, (10), 8 states have call predecessors, (10), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2021-08-30 17:03:38,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:03:38,016 INFO L93 Difference]: Finished difference Result 4112 states and 5734 transitions. [2021-08-30 17:03:38,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-08-30 17:03:38,021 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 12 states have internal predecessors, (44), 4 states have call successors, (10), 8 states have call predecessors, (10), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 38 [2021-08-30 17:03:38,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:03:38,041 INFO L225 Difference]: With dead ends: 4112 [2021-08-30 17:03:38,042 INFO L226 Difference]: Without dead ends: 3866 [2021-08-30 17:03:38,042 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 68 SyntacticMatches, 6 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 747.12ms TimeCoverageRelationStatistics Valid=334, Invalid=1388, Unknown=0, NotChecked=0, Total=1722 [2021-08-30 17:03:38,043 INFO L928 BasicCegarLoop]: 10 mSDtfsCounter, 756 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 1150 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 610.17ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 761 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 1393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.69ms SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 1150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 724.76ms IncrementalHoareTripleChecker+Time [2021-08-30 17:03:38,043 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [761 Valid, 15 Invalid, 1393 Unknown, 0 Unchecked, 8.69ms Time], IncrementalHoareTripleChecker [243 Valid, 1150 Invalid, 0 Unknown, 0 Unchecked, 724.76ms Time] [2021-08-30 17:03:38,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3866 states. [2021-08-30 17:03:38,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3866 to 3347. [2021-08-30 17:03:38,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3347 states, 2692 states have (on average 1.4097325408618129) internal successors, (3795), 3018 states have internal predecessors, (3795), 234 states have call successors, (234), 211 states have call predecessors, (234), 409 states have return successors, (704), 118 states have call predecessors, (704), 233 states have call successors, (704) [2021-08-30 17:03:38,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3347 states to 3347 states and 4733 transitions. [2021-08-30 17:03:38,157 INFO L78 Accepts]: Start accepts. Automaton has 3347 states and 4733 transitions. Word has length 38 [2021-08-30 17:03:38,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:03:38,159 INFO L470 AbstractCegarLoop]: Abstraction has 3347 states and 4733 transitions. [2021-08-30 17:03:38,159 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 12 states have internal predecessors, (44), 4 states have call successors, (10), 8 states have call predecessors, (10), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2021-08-30 17:03:38,159 INFO L276 IsEmpty]: Start isEmpty. Operand 3347 states and 4733 transitions. [2021-08-30 17:03:38,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-08-30 17:03:38,162 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:03:38,162 INFO L513 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:03:38,188 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-08-30 17:03:38,378 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-08-30 17:03:38,378 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting popErr0REQUIRES_VIOLATION === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-30 17:03:38,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:03:38,378 INFO L82 PathProgramCache]: Analyzing trace with hash 57126017, now seen corresponding path program 1 times [2021-08-30 17:03:38,379 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:03:38,379 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192425418] [2021-08-30 17:03:38,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:03:38,379 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:03:38,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:03:38,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:03:38,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:03:38,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-30 17:03:38,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:03:38,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-30 17:03:38,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:03:38,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-08-30 17:03:38,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:03:38,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-08-30 17:03:38,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:03:38,664 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 18 proven. 32 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-08-30 17:03:38,664 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:03:38,664 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192425418] [2021-08-30 17:03:38,664 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192425418] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:03:38,665 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995383398] [2021-08-30 17:03:38,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:03:38,665 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:03:38,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:03:38,669 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:03:38,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-08-30 17:03:38,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:03:38,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 13 conjunts are in the unsatisfiable core [2021-08-30 17:03:38,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:03:39,072 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 24 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-08-30 17:03:39,073 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:03:39,416 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 31 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-08-30 17:03:39,416 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1995383398] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:03:39,416 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:03:39,417 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 10] total 26 [2021-08-30 17:03:39,417 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893152753] [2021-08-30 17:03:39,417 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-08-30 17:03:39,417 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:03:39,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-08-30 17:03:39,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=554, Unknown=0, NotChecked=0, Total=650 [2021-08-30 17:03:39,418 INFO L87 Difference]: Start difference. First operand 3347 states and 4733 transitions. Second operand has 26 states, 26 states have (on average 4.076923076923077) internal successors, (106), 20 states have internal predecessors, (106), 9 states have call successors, (16), 11 states have call predecessors, (16), 11 states have return successors, (13), 9 states have call predecessors, (13), 9 states have call successors, (13) [2021-08-30 17:03:53,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:03:53,229 INFO L93 Difference]: Finished difference Result 27019 states and 37970 transitions. [2021-08-30 17:03:53,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 267 states. [2021-08-30 17:03:53,231 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.076923076923077) internal successors, (106), 20 states have internal predecessors, (106), 9 states have call successors, (16), 11 states have call predecessors, (16), 11 states have return successors, (13), 9 states have call predecessors, (13), 9 states have call successors, (13) Word has length 60 [2021-08-30 17:03:53,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:03:53,382 INFO L225 Difference]: With dead ends: 27019 [2021-08-30 17:03:53,382 INFO L226 Difference]: Without dead ends: 26494 [2021-08-30 17:03:53,400 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 506 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 287 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35018 ImplicationChecksByTransitivity, 8702.76ms TimeCoverageRelationStatistics Valid=8838, Invalid=74394, Unknown=0, NotChecked=0, Total=83232 [2021-08-30 17:03:53,400 INFO L928 BasicCegarLoop]: 27 mSDtfsCounter, 1993 mSDsluCounter, 1017 mSDsCounter, 0 mSdLazyCounter, 8766 mSolverCounterSat, 1423 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4059.86ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1997 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 10189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 47.77ms SdHoareTripleChecker+Time, 1423 IncrementalHoareTripleChecker+Valid, 8766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4944.49ms IncrementalHoareTripleChecker+Time [2021-08-30 17:03:53,401 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [1997 Valid, 64 Invalid, 10189 Unknown, 0 Unchecked, 47.77ms Time], IncrementalHoareTripleChecker [1423 Valid, 8766 Invalid, 0 Unknown, 0 Unchecked, 4944.49ms Time] [2021-08-30 17:03:53,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26494 states. [2021-08-30 17:03:54,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26494 to 23763. [2021-08-30 17:03:54,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23763 states, 19195 states have (on average 1.3662412086480855) internal successors, (26225), 21381 states have internal predecessors, (26225), 1832 states have call successors, (1832), 1464 states have call predecessors, (1832), 2725 states have return successors, (5334), 918 states have call predecessors, (5334), 1831 states have call successors, (5334) [2021-08-30 17:03:54,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23763 states to 23763 states and 33391 transitions. [2021-08-30 17:03:54,209 INFO L78 Accepts]: Start accepts. Automaton has 23763 states and 33391 transitions. Word has length 60 [2021-08-30 17:03:54,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:03:54,210 INFO L470 AbstractCegarLoop]: Abstraction has 23763 states and 33391 transitions. [2021-08-30 17:03:54,211 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.076923076923077) internal successors, (106), 20 states have internal predecessors, (106), 9 states have call successors, (16), 11 states have call predecessors, (16), 11 states have return successors, (13), 9 states have call predecessors, (13), 9 states have call successors, (13) [2021-08-30 17:03:54,211 INFO L276 IsEmpty]: Start isEmpty. Operand 23763 states and 33391 transitions. [2021-08-30 17:03:54,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-08-30 17:03:54,216 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:03:54,216 INFO L513 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:03:54,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-08-30 17:03:54,436 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-08-30 17:03:54,437 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr5ENSURES_VIOLATIONMEMORY_LEAK === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-30 17:03:54,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:03:54,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1976715241, now seen corresponding path program 1 times [2021-08-30 17:03:54,437 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:03:54,438 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454946408] [2021-08-30 17:03:54,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:03:54,438 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:03:54,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:03:54,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:03:54,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:03:54,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-30 17:03:54,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:03:54,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-30 17:03:54,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:03:54,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-08-30 17:03:54,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:03:54,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-08-30 17:03:54,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:03:54,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-08-30 17:03:54,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:03:54,632 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 59 proven. 4 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2021-08-30 17:03:54,632 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:03:54,633 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454946408] [2021-08-30 17:03:54,633 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454946408] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:03:54,633 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959504768] [2021-08-30 17:03:54,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:03:54,633 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:03:54,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:03:54,634 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:03:54,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-08-30 17:03:54,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:03:54,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 25 conjunts are in the unsatisfiable core [2021-08-30 17:03:54,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:03:55,102 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 15 proven. 65 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-08-30 17:03:55,103 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:03:55,583 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 23 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 17:03:55,584 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1959504768] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:03:55,584 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:03:55,584 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 19] total 27 [2021-08-30 17:03:55,584 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934718528] [2021-08-30 17:03:55,584 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-08-30 17:03:55,585 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:03:55,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-08-30 17:03:55,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=551, Unknown=0, NotChecked=0, Total=702 [2021-08-30 17:03:55,586 INFO L87 Difference]: Start difference. First operand 23763 states and 33391 transitions. Second operand has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 19 states have internal predecessors, (96), 6 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) [2021-08-30 17:03:57,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:03:57,263 INFO L93 Difference]: Finished difference Result 40625 states and 59437 transitions. [2021-08-30 17:03:57,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-30 17:03:57,264 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 19 states have internal predecessors, (96), 6 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) Word has length 69 [2021-08-30 17:03:57,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:03:57,439 INFO L225 Difference]: With dead ends: 40625 [2021-08-30 17:03:57,440 INFO L226 Difference]: Without dead ends: 40625 [2021-08-30 17:03:57,440 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 142 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 942 ImplicationChecksByTransitivity, 1008.76ms TimeCoverageRelationStatistics Valid=991, Invalid=3041, Unknown=0, NotChecked=0, Total=4032 [2021-08-30 17:03:57,441 INFO L928 BasicCegarLoop]: 8 mSDtfsCounter, 984 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 1296 mSolverCounterSat, 366 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 600.08ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 994 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 1662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.35ms SdHoareTripleChecker+Time, 366 IncrementalHoareTripleChecker+Valid, 1296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 739.55ms IncrementalHoareTripleChecker+Time [2021-08-30 17:03:57,441 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [994 Valid, 30 Invalid, 1662 Unknown, 0 Unchecked, 7.35ms Time], IncrementalHoareTripleChecker [366 Valid, 1296 Invalid, 0 Unknown, 0 Unchecked, 739.55ms Time] [2021-08-30 17:03:57,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40625 states. [2021-08-30 17:03:58,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40625 to 34806. [2021-08-30 17:03:58,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34806 states, 27889 states have (on average 1.3774247911362902) internal successors, (38415), 31361 states have internal predecessors, (38415), 2662 states have call successors, (2662), 2112 states have call predecessors, (2662), 4244 states have return successors, (9114), 1333 states have call predecessors, (9114), 2661 states have call successors, (9114) [2021-08-30 17:03:58,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34806 states to 34806 states and 50191 transitions. [2021-08-30 17:03:58,977 INFO L78 Accepts]: Start accepts. Automaton has 34806 states and 50191 transitions. Word has length 69 [2021-08-30 17:03:58,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:03:58,977 INFO L470 AbstractCegarLoop]: Abstraction has 34806 states and 50191 transitions. [2021-08-30 17:03:58,977 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 19 states have internal predecessors, (96), 6 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) [2021-08-30 17:03:58,978 INFO L276 IsEmpty]: Start isEmpty. Operand 34806 states and 50191 transitions. [2021-08-30 17:03:58,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-08-30 17:03:58,983 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:03:58,983 INFO L513 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:03:59,007 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-08-30 17:03:59,196 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:03:59,197 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr5ENSURES_VIOLATIONMEMORY_LEAK === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-30 17:03:59,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:03:59,197 INFO L82 PathProgramCache]: Analyzing trace with hash 310673359, now seen corresponding path program 1 times [2021-08-30 17:03:59,197 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:03:59,197 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522446349] [2021-08-30 17:03:59,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:03:59,198 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:03:59,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:03:59,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:03:59,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:03:59,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-30 17:03:59,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:03:59,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-30 17:03:59,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:03:59,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-08-30 17:03:59,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:03:59,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-08-30 17:03:59,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:03:59,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-08-30 17:03:59,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:03:59,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-08-30 17:03:59,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:03:59,374 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 77 proven. 5 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2021-08-30 17:03:59,375 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:03:59,375 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522446349] [2021-08-30 17:03:59,375 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522446349] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:03:59,375 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1522630076] [2021-08-30 17:03:59,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:03:59,375 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:03:59,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:03:59,377 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:03:59,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-08-30 17:03:59,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:03:59,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 638 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-30 17:03:59,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:03:59,750 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 126 proven. 5 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2021-08-30 17:03:59,751 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:04:00,008 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 84 proven. 27 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2021-08-30 17:04:00,010 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1522630076] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:04:00,010 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:04:00,010 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 20 [2021-08-30 17:04:00,010 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965158192] [2021-08-30 17:04:00,011 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-08-30 17:04:00,011 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:04:00,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-08-30 17:04:00,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2021-08-30 17:04:00,012 INFO L87 Difference]: Start difference. First operand 34806 states and 50191 transitions. Second operand has 20 states, 20 states have (on average 3.9) internal successors, (78), 16 states have internal predecessors, (78), 4 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2021-08-30 17:04:01,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:04:01,880 INFO L93 Difference]: Finished difference Result 63043 states and 92085 transitions. [2021-08-30 17:04:01,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-08-30 17:04:01,880 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.9) internal successors, (78), 16 states have internal predecessors, (78), 4 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 80 [2021-08-30 17:04:01,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:04:02,138 INFO L225 Difference]: With dead ends: 63043 [2021-08-30 17:04:02,138 INFO L226 Difference]: Without dead ends: 63043 [2021-08-30 17:04:02,139 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 174 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 772.84ms TimeCoverageRelationStatistics Valid=431, Invalid=1825, Unknown=0, NotChecked=0, Total=2256 [2021-08-30 17:04:02,140 INFO L928 BasicCegarLoop]: 12 mSDtfsCounter, 463 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 2005 mSolverCounterSat, 279 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 738.45ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 2284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.33ms SdHoareTripleChecker+Time, 279 IncrementalHoareTripleChecker+Valid, 2005 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 887.79ms IncrementalHoareTripleChecker+Time [2021-08-30 17:04:02,141 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [467 Valid, 24 Invalid, 2284 Unknown, 0 Unchecked, 8.33ms Time], IncrementalHoareTripleChecker [279 Valid, 2005 Invalid, 0 Unknown, 0 Unchecked, 887.79ms Time] [2021-08-30 17:04:02,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63043 states. [2021-08-30 17:04:03,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63043 to 50001. [2021-08-30 17:04:03,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50001 states, 39523 states have (on average 1.3606507603167777) internal successors, (53777), 45084 states have internal predecessors, (53777), 3824 states have call successors, (3824), 3003 states have call predecessors, (3824), 6643 states have return successors, (14655), 1914 states have call predecessors, (14655), 3823 states have call successors, (14655) [2021-08-30 17:04:03,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50001 states to 50001 states and 72256 transitions. [2021-08-30 17:04:03,551 INFO L78 Accepts]: Start accepts. Automaton has 50001 states and 72256 transitions. Word has length 80 [2021-08-30 17:04:03,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:04:03,552 INFO L470 AbstractCegarLoop]: Abstraction has 50001 states and 72256 transitions. [2021-08-30 17:04:03,552 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.9) internal successors, (78), 16 states have internal predecessors, (78), 4 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2021-08-30 17:04:03,552 INFO L276 IsEmpty]: Start isEmpty. Operand 50001 states and 72256 transitions. [2021-08-30 17:04:03,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-08-30 17:04:03,561 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:04:03,561 INFO L513 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:04:03,590 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-08-30 17:04:03,776 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-08-30 17:04:03,777 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr5ENSURES_VIOLATIONMEMORY_LEAK === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-30 17:04:03,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:04:03,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1597325583, now seen corresponding path program 1 times [2021-08-30 17:04:03,777 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:04:03,777 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416427291] [2021-08-30 17:04:03,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:04:03,778 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:04:03,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:04:03,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:04:03,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:04:03,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-30 17:04:03,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:04:03,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-30 17:04:03,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:04:03,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-08-30 17:04:03,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:04:03,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-08-30 17:04:03,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:04:03,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-08-30 17:04:03,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:04:03,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-08-30 17:04:03,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:04:03,951 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 80 proven. 6 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2021-08-30 17:04:03,952 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:04:03,952 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416427291] [2021-08-30 17:04:03,952 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416427291] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:04:03,952 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229736680] [2021-08-30 17:04:03,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:04:03,952 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:04:03,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:04:03,981 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:04:03,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-08-30 17:04:04,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:04:04,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 14 conjunts are in the unsatisfiable core [2021-08-30 17:04:04,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:04:04,396 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 131 proven. 17 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-08-30 17:04:04,396 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:04:04,756 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 102 proven. 37 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-08-30 17:04:04,757 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229736680] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:04:04,757 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:04:04,757 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 12] total 24 [2021-08-30 17:04:04,757 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524094294] [2021-08-30 17:04:04,757 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-08-30 17:04:04,757 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:04:04,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-08-30 17:04:04,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=475, Unknown=0, NotChecked=0, Total=552 [2021-08-30 17:04:04,758 INFO L87 Difference]: Start difference. First operand 50001 states and 72256 transitions. Second operand has 24 states, 24 states have (on average 4.25) internal successors, (102), 19 states have internal predecessors, (102), 5 states have call successors, (12), 7 states have call predecessors, (12), 8 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2021-08-30 17:04:07,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:04:07,326 INFO L93 Difference]: Finished difference Result 68772 states and 100028 transitions. [2021-08-30 17:04:07,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-08-30 17:04:07,327 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.25) internal successors, (102), 19 states have internal predecessors, (102), 5 states have call successors, (12), 7 states have call predecessors, (12), 8 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 84 [2021-08-30 17:04:07,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:04:07,612 INFO L225 Difference]: With dead ends: 68772 [2021-08-30 17:04:07,613 INFO L226 Difference]: Without dead ends: 68772 [2021-08-30 17:04:07,613 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 186 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1058 ImplicationChecksByTransitivity, 1138.00ms TimeCoverageRelationStatistics Valid=807, Invalid=3483, Unknown=0, NotChecked=0, Total=4290 [2021-08-30 17:04:07,614 INFO L928 BasicCegarLoop]: 13 mSDtfsCounter, 658 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 2352 mSolverCounterSat, 439 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 955.79ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 663 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 2791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 10.38ms SdHoareTripleChecker+Time, 439 IncrementalHoareTripleChecker+Valid, 2352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1300.63ms IncrementalHoareTripleChecker+Time [2021-08-30 17:04:07,614 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [663 Valid, 23 Invalid, 2791 Unknown, 0 Unchecked, 10.38ms Time], IncrementalHoareTripleChecker [439 Valid, 2352 Invalid, 0 Unknown, 0 Unchecked, 1300.63ms Time] [2021-08-30 17:04:07,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68772 states. [2021-08-30 17:04:09,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68772 to 58057. [2021-08-30 17:04:09,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58057 states, 46036 states have (on average 1.3481405856286384) internal successors, (62063), 52244 states have internal predecessors, (62063), 4511 states have call successors, (4511), 3449 states have call predecessors, (4511), 7499 states have return successors, (15773), 2364 states have call predecessors, (15773), 4510 states have call successors, (15773) [2021-08-30 17:04:09,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58057 states to 58057 states and 82347 transitions. [2021-08-30 17:04:09,595 INFO L78 Accepts]: Start accepts. Automaton has 58057 states and 82347 transitions. Word has length 84 [2021-08-30 17:04:09,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:04:09,596 INFO L470 AbstractCegarLoop]: Abstraction has 58057 states and 82347 transitions. [2021-08-30 17:04:09,596 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.25) internal successors, (102), 19 states have internal predecessors, (102), 5 states have call successors, (12), 7 states have call predecessors, (12), 8 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2021-08-30 17:04:09,596 INFO L276 IsEmpty]: Start isEmpty. Operand 58057 states and 82347 transitions. [2021-08-30 17:04:09,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-08-30 17:04:09,607 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:04:09,607 INFO L513 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:04:09,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-08-30 17:04:09,817 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-08-30 17:04:09,818 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr5ENSURES_VIOLATIONMEMORY_LEAK === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-30 17:04:09,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:04:09,818 INFO L82 PathProgramCache]: Analyzing trace with hash -478636956, now seen corresponding path program 1 times [2021-08-30 17:04:09,818 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:04:09,818 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145569705] [2021-08-30 17:04:09,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:04:09,819 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:04:09,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:04:09,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:04:09,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:04:09,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-30 17:04:09,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:04:09,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-30 17:04:09,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:04:09,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-08-30 17:04:09,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:04:09,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-08-30 17:04:09,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:04:09,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-08-30 17:04:09,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:04:09,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-08-30 17:04:09,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:04:10,007 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 38 proven. 67 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2021-08-30 17:04:10,007 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:04:10,007 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145569705] [2021-08-30 17:04:10,007 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145569705] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:04:10,007 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613695653] [2021-08-30 17:04:10,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:04:10,008 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:04:10,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:04:10,009 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:04:10,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-08-30 17:04:10,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:04:10,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 651 conjuncts, 25 conjunts are in the unsatisfiable core [2021-08-30 17:04:10,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:04:10,386 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 49 proven. 65 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2021-08-30 17:04:10,386 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:04:10,857 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 43 proven. 71 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2021-08-30 17:04:10,858 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1613695653] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:04:10,858 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:04:10,858 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 14 [2021-08-30 17:04:10,858 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428300057] [2021-08-30 17:04:10,859 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-08-30 17:04:10,859 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:04:10,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-30 17:04:10,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2021-08-30 17:04:10,859 INFO L87 Difference]: Start difference. First operand 58057 states and 82347 transitions. Second operand has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 12 states have internal predecessors, (75), 3 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-08-30 17:04:11,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:04:11,718 INFO L93 Difference]: Finished difference Result 56532 states and 79969 transitions. [2021-08-30 17:04:11,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-08-30 17:04:11,718 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 12 states have internal predecessors, (75), 3 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 85 [2021-08-30 17:04:11,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:04:12,101 INFO L225 Difference]: With dead ends: 56532 [2021-08-30 17:04:12,101 INFO L226 Difference]: Without dead ends: 56532 [2021-08-30 17:04:12,102 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 359.90ms TimeCoverageRelationStatistics Valid=216, Invalid=654, Unknown=0, NotChecked=0, Total=870 [2021-08-30 17:04:12,102 INFO L928 BasicCegarLoop]: 9 mSDtfsCounter, 312 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 930 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 332.86ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 1044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.67ms SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 407.03ms IncrementalHoareTripleChecker+Time [2021-08-30 17:04:12,102 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [315 Valid, 28 Invalid, 1044 Unknown, 0 Unchecked, 3.67ms Time], IncrementalHoareTripleChecker [114 Valid, 930 Invalid, 0 Unknown, 0 Unchecked, 407.03ms Time] [2021-08-30 17:04:12,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56532 states. [2021-08-30 17:04:13,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56532 to 56449. [2021-08-30 17:04:13,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56449 states, 44725 states have (on average 1.3447736165455562) internal successors, (60145), 50764 states have internal predecessors, (60145), 4411 states have call successors, (4411), 3371 states have call predecessors, (4411), 7302 states have return successors, (15327), 2314 states have call predecessors, (15327), 4410 states have call successors, (15327) [2021-08-30 17:04:13,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56449 states to 56449 states and 79883 transitions. [2021-08-30 17:04:13,321 INFO L78 Accepts]: Start accepts. Automaton has 56449 states and 79883 transitions. Word has length 85 [2021-08-30 17:04:13,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:04:13,322 INFO L470 AbstractCegarLoop]: Abstraction has 56449 states and 79883 transitions. [2021-08-30 17:04:13,322 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 12 states have internal predecessors, (75), 3 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-08-30 17:04:13,322 INFO L276 IsEmpty]: Start isEmpty. Operand 56449 states and 79883 transitions. [2021-08-30 17:04:13,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-08-30 17:04:13,332 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:04:13,333 INFO L513 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:04:13,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-08-30 17:04:13,558 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:04:13,558 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr5ENSURES_VIOLATIONMEMORY_LEAK === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-30 17:04:13,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:04:13,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1378069754, now seen corresponding path program 1 times [2021-08-30 17:04:13,558 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:04:13,559 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565229990] [2021-08-30 17:04:13,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:04:13,559 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:04:13,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:04:13,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:04:13,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:04:13,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-30 17:04:13,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:04:13,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-30 17:04:13,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:04:13,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-08-30 17:04:13,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:04:13,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-08-30 17:04:13,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:04:13,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-08-30 17:04:13,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:04:13,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-08-30 17:04:13,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:04:13,756 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 84 proven. 20 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2021-08-30 17:04:13,756 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:04:13,756 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565229990] [2021-08-30 17:04:13,756 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565229990] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:04:13,756 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40494242] [2021-08-30 17:04:13,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:04:13,757 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:04:13,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:04:13,758 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:04:13,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-08-30 17:04:13,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:04:13,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 646 conjuncts, 21 conjunts are in the unsatisfiable core [2021-08-30 17:04:13,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:04:14,230 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 128 proven. 21 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-08-30 17:04:14,230 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:04:14,931 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 97 proven. 43 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-08-30 17:04:14,939 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40494242] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:04:14,940 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:04:14,940 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 12] total 21 [2021-08-30 17:04:14,940 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581088602] [2021-08-30 17:04:14,940 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-08-30 17:04:14,941 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:04:14,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-08-30 17:04:14,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2021-08-30 17:04:14,942 INFO L87 Difference]: Start difference. First operand 56449 states and 79883 transitions. Second operand has 21 states, 21 states have (on average 4.476190476190476) internal successors, (94), 16 states have internal predecessors, (94), 4 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2021-08-30 17:04:17,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:04:17,451 INFO L93 Difference]: Finished difference Result 92950 states and 144354 transitions. [2021-08-30 17:04:17,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-08-30 17:04:17,451 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.476190476190476) internal successors, (94), 16 states have internal predecessors, (94), 4 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 86 [2021-08-30 17:04:17,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:04:17,843 INFO L225 Difference]: With dead ends: 92950 [2021-08-30 17:04:17,844 INFO L226 Difference]: Without dead ends: 88506 [2021-08-30 17:04:17,844 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 184 SyntacticMatches, 5 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 1114.71ms TimeCoverageRelationStatistics Valid=520, Invalid=2342, Unknown=0, NotChecked=0, Total=2862 [2021-08-30 17:04:17,847 INFO L928 BasicCegarLoop]: 18 mSDtfsCounter, 458 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 2149 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 976.86ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 2382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.42ms SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 2149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1133.30ms IncrementalHoareTripleChecker+Time [2021-08-30 17:04:17,848 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [463 Valid, 49 Invalid, 2382 Unknown, 0 Unchecked, 8.42ms Time], IncrementalHoareTripleChecker [233 Valid, 2149 Invalid, 0 Unknown, 0 Unchecked, 1133.30ms Time] [2021-08-30 17:04:17,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88506 states. [2021-08-30 17:04:19,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88506 to 54619. [2021-08-30 17:04:19,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54619 states, 42962 states have (on average 1.3264978352963084) internal successors, (56989), 49292 states have internal predecessors, (56989), 4048 states have call successors, (4048), 3281 states have call predecessors, (4048), 7598 states have return successors, (15501), 2046 states have call predecessors, (15501), 4047 states have call successors, (15501) [2021-08-30 17:04:19,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54619 states to 54619 states and 76538 transitions. [2021-08-30 17:04:19,560 INFO L78 Accepts]: Start accepts. Automaton has 54619 states and 76538 transitions. Word has length 86 [2021-08-30 17:04:19,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:04:19,560 INFO L470 AbstractCegarLoop]: Abstraction has 54619 states and 76538 transitions. [2021-08-30 17:04:19,560 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.476190476190476) internal successors, (94), 16 states have internal predecessors, (94), 4 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2021-08-30 17:04:19,560 INFO L276 IsEmpty]: Start isEmpty. Operand 54619 states and 76538 transitions. [2021-08-30 17:04:19,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-08-30 17:04:19,568 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:04:19,568 INFO L513 BasicCegarLoop]: trace histogram [8, 8, 7, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:04:19,595 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2021-08-30 17:04:19,784 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:04:19,785 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting popErr1REQUIRES_VIOLATION === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-30 17:04:19,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:04:19,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1349188980, now seen corresponding path program 1 times [2021-08-30 17:04:19,786 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:04:19,786 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578138238] [2021-08-30 17:04:19,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:04:19,786 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:04:20,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:04:20,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:04:20,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:04:20,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-30 17:04:20,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:04:20,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-30 17:04:20,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:04:20,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-08-30 17:04:20,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:04:20,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-08-30 17:04:20,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:04:20,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-08-30 17:04:20,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:04:20,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-08-30 17:04:20,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:04:20,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-08-30 17:04:20,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:04:20,226 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 109 proven. 4 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2021-08-30 17:04:20,226 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:04:20,226 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578138238] [2021-08-30 17:04:20,226 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578138238] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:04:20,227 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1508201966] [2021-08-30 17:04:20,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:04:20,229 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:04:20,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:04:20,230 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:04:20,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-08-30 17:04:20,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:04:20,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 746 conjuncts, 17 conjunts are in the unsatisfiable core [2021-08-30 17:04:20,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:04:20,696 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 111 proven. 8 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2021-08-30 17:04:20,696 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:04:21,086 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 86 proven. 44 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2021-08-30 17:04:21,086 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1508201966] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:04:21,086 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:04:21,086 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 13] total 25 [2021-08-30 17:04:21,087 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854097683] [2021-08-30 17:04:21,087 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-08-30 17:04:21,087 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:04:21,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-08-30 17:04:21,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=512, Unknown=0, NotChecked=0, Total=600 [2021-08-30 17:04:21,088 INFO L87 Difference]: Start difference. First operand 54619 states and 76538 transitions. Second operand has 25 states, 25 states have (on average 4.32) internal successors, (108), 18 states have internal predecessors, (108), 6 states have call successors, (17), 10 states have call predecessors, (17), 9 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2021-08-30 17:04:23,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:04:23,012 INFO L93 Difference]: Finished difference Result 28067 states and 36840 transitions. [2021-08-30 17:04:23,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-08-30 17:04:23,012 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 4.32) internal successors, (108), 18 states have internal predecessors, (108), 6 states have call successors, (17), 10 states have call predecessors, (17), 9 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) Word has length 93 [2021-08-30 17:04:23,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:04:23,222 INFO L225 Difference]: With dead ends: 28067 [2021-08-30 17:04:23,222 INFO L226 Difference]: Without dead ends: 27420 [2021-08-30 17:04:23,223 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 204 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 727 ImplicationChecksByTransitivity, 1227.83ms TimeCoverageRelationStatistics Valid=738, Invalid=2684, Unknown=0, NotChecked=0, Total=3422 [2021-08-30 17:04:23,224 INFO L928 BasicCegarLoop]: 9 mSDtfsCounter, 673 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 1922 mSolverCounterSat, 369 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 730.69ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 673 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 2291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.91ms SdHoareTripleChecker+Time, 369 IncrementalHoareTripleChecker+Valid, 1922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 865.05ms IncrementalHoareTripleChecker+Time [2021-08-30 17:04:23,224 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [673 Valid, 19 Invalid, 2291 Unknown, 0 Unchecked, 7.91ms Time], IncrementalHoareTripleChecker [369 Valid, 1922 Invalid, 0 Unknown, 0 Unchecked, 865.05ms Time] [2021-08-30 17:04:23,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27420 states. [2021-08-30 17:04:23,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27420 to 25543. [2021-08-30 17:04:23,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25543 states, 20289 states have (on average 1.2826654837596727) internal successors, (26024), 22947 states have internal predecessors, (26024), 1840 states have call successors, (1840), 1654 states have call predecessors, (1840), 3403 states have return successors, (5569), 942 states have call predecessors, (5569), 1839 states have call successors, (5569) [2021-08-30 17:04:23,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25543 states to 25543 states and 33433 transitions. [2021-08-30 17:04:23,612 INFO L78 Accepts]: Start accepts. Automaton has 25543 states and 33433 transitions. Word has length 93 [2021-08-30 17:04:23,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:04:23,613 INFO L470 AbstractCegarLoop]: Abstraction has 25543 states and 33433 transitions. [2021-08-30 17:04:23,613 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 4.32) internal successors, (108), 18 states have internal predecessors, (108), 6 states have call successors, (17), 10 states have call predecessors, (17), 9 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2021-08-30 17:04:23,613 INFO L276 IsEmpty]: Start isEmpty. Operand 25543 states and 33433 transitions. [2021-08-30 17:04:23,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-08-30 17:04:23,616 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:04:23,616 INFO L513 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:04:23,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-08-30 17:04:23,832 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-08-30 17:04:23,833 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr5ENSURES_VIOLATIONMEMORY_LEAK === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-30 17:04:23,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:04:23,834 INFO L82 PathProgramCache]: Analyzing trace with hash -616739140, now seen corresponding path program 1 times [2021-08-30 17:04:23,834 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:04:23,834 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59714404] [2021-08-30 17:04:23,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:04:23,834 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:04:23,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:04:23,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:04:23,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:04:23,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-30 17:04:23,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:04:23,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-30 17:04:23,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:04:23,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-08-30 17:04:23,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:04:24,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-08-30 17:04:24,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:04:24,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-08-30 17:04:24,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:04:24,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-08-30 17:04:24,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:04:24,046 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 70 proven. 42 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-08-30 17:04:24,046 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:04:24,046 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59714404] [2021-08-30 17:04:24,046 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59714404] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:04:24,046 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69955686] [2021-08-30 17:04:24,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:04:24,047 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:04:24,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:04:24,053 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:04:24,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-08-30 17:04:24,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:04:24,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 647 conjuncts, 38 conjunts are in the unsatisfiable core [2021-08-30 17:04:24,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:04:24,494 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 108 proven. 46 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-08-30 17:04:24,494 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:04:25,061 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 52 proven. 118 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-08-30 17:04:25,061 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [69955686] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:04:25,062 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:04:25,062 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 16] total 26 [2021-08-30 17:04:25,062 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336212657] [2021-08-30 17:04:25,062 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-08-30 17:04:25,062 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:04:25,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-08-30 17:04:25,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=562, Unknown=0, NotChecked=0, Total=650 [2021-08-30 17:04:25,063 INFO L87 Difference]: Start difference. First operand 25543 states and 33433 transitions. Second operand has 26 states, 26 states have (on average 4.5) internal successors, (117), 19 states have internal predecessors, (117), 6 states have call successors, (17), 10 states have call predecessors, (17), 10 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2021-08-30 17:04:27,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:04:27,454 INFO L93 Difference]: Finished difference Result 15071 states and 18661 transitions. [2021-08-30 17:04:27,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-08-30 17:04:27,456 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.5) internal successors, (117), 19 states have internal predecessors, (117), 6 states have call successors, (17), 10 states have call predecessors, (17), 10 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) Word has length 92 [2021-08-30 17:04:27,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:04:27,482 INFO L225 Difference]: With dead ends: 15071 [2021-08-30 17:04:27,482 INFO L226 Difference]: Without dead ends: 14135 [2021-08-30 17:04:27,483 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 192 SyntacticMatches, 4 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 911 ImplicationChecksByTransitivity, 1594.46ms TimeCoverageRelationStatistics Valid=740, Invalid=3420, Unknown=0, NotChecked=0, Total=4160 [2021-08-30 17:04:27,484 INFO L928 BasicCegarLoop]: 14 mSDtfsCounter, 1515 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 2304 mSolverCounterSat, 545 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 856.89ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1515 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 2849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 10.03ms SdHoareTripleChecker+Time, 545 IncrementalHoareTripleChecker+Valid, 2304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1027.94ms IncrementalHoareTripleChecker+Time [2021-08-30 17:04:27,484 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [1515 Valid, 24 Invalid, 2849 Unknown, 0 Unchecked, 10.03ms Time], IncrementalHoareTripleChecker [545 Valid, 2304 Invalid, 0 Unknown, 0 Unchecked, 1027.94ms Time] [2021-08-30 17:04:27,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14135 states. [2021-08-30 17:04:27,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14135 to 13244. [2021-08-30 17:04:27,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13244 states, 10588 states have (on average 1.2567057045712127) internal successors, (13306), 11763 states have internal predecessors, (13306), 988 states have call successors, (988), 970 states have call predecessors, (988), 1657 states have return successors, (2385), 511 states have call predecessors, (2385), 987 states have call successors, (2385) [2021-08-30 17:04:27,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13244 states to 13244 states and 16679 transitions. [2021-08-30 17:04:27,676 INFO L78 Accepts]: Start accepts. Automaton has 13244 states and 16679 transitions. Word has length 92 [2021-08-30 17:04:27,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:04:27,677 INFO L470 AbstractCegarLoop]: Abstraction has 13244 states and 16679 transitions. [2021-08-30 17:04:27,677 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.5) internal successors, (117), 19 states have internal predecessors, (117), 6 states have call successors, (17), 10 states have call predecessors, (17), 10 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2021-08-30 17:04:27,677 INFO L276 IsEmpty]: Start isEmpty. Operand 13244 states and 16679 transitions. [2021-08-30 17:04:27,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-08-30 17:04:27,679 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:04:27,679 INFO L513 BasicCegarLoop]: trace histogram [8, 8, 7, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:04:27,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-08-30 17:04:27,893 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-08-30 17:04:27,894 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting popErr1REQUIRES_VIOLATION === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-30 17:04:27,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:04:27,894 INFO L82 PathProgramCache]: Analyzing trace with hash 259058990, now seen corresponding path program 1 times [2021-08-30 17:04:27,894 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:04:27,895 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136322882] [2021-08-30 17:04:27,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:04:27,895 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:04:27,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:04:28,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:04:28,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:04:28,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-30 17:04:28,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:04:28,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-30 17:04:28,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:04:28,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-08-30 17:04:28,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:04:28,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-08-30 17:04:28,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:04:28,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-08-30 17:04:28,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:04:28,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-08-30 17:04:28,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:04:28,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-08-30 17:04:28,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:04:28,187 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 36 proven. 80 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2021-08-30 17:04:28,187 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:04:28,187 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136322882] [2021-08-30 17:04:28,187 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136322882] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:04:28,187 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176338095] [2021-08-30 17:04:28,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:04:28,188 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:04:28,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:04:28,201 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:04:28,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-08-30 17:04:28,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:04:28,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 749 conjuncts, 57 conjunts are in the unsatisfiable core [2021-08-30 17:04:28,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:04:29,068 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 108 proven. 33 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2021-08-30 17:04:29,069 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:04:29,697 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 97 proven. 30 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2021-08-30 17:04:29,697 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1176338095] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:04:29,697 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:04:29,697 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 9] total 26 [2021-08-30 17:04:29,697 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751474854] [2021-08-30 17:04:29,698 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-08-30 17:04:29,698 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:04:29,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-08-30 17:04:29,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=599, Unknown=0, NotChecked=0, Total=702 [2021-08-30 17:04:29,699 INFO L87 Difference]: Start difference. First operand 13244 states and 16679 transitions. Second operand has 27 states, 26 states have (on average 4.576923076923077) internal successors, (119), 24 states have internal predecessors, (119), 7 states have call successors, (17), 13 states have call predecessors, (17), 15 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2021-08-30 17:04:35,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:04:35,021 INFO L93 Difference]: Finished difference Result 22630 states and 28267 transitions. [2021-08-30 17:04:35,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2021-08-30 17:04:35,021 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 4.576923076923077) internal successors, (119), 24 states have internal predecessors, (119), 7 states have call successors, (17), 13 states have call predecessors, (17), 15 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) Word has length 95 [2021-08-30 17:04:35,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:04:35,061 INFO L225 Difference]: With dead ends: 22630 [2021-08-30 17:04:35,061 INFO L226 Difference]: Without dead ends: 22628 [2021-08-30 17:04:35,062 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 215 SyntacticMatches, 53 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3845 ImplicationChecksByTransitivity, 3875.54ms TimeCoverageRelationStatistics Valid=1531, Invalid=6301, Unknown=0, NotChecked=0, Total=7832 [2021-08-30 17:04:35,063 INFO L928 BasicCegarLoop]: 17 mSDtfsCounter, 1216 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 2627 mSolverCounterSat, 581 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1389.03ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1220 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 3568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 15.52ms SdHoareTripleChecker+Time, 581 IncrementalHoareTripleChecker+Valid, 2627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 360 IncrementalHoareTripleChecker+Unchecked, 1677.42ms IncrementalHoareTripleChecker+Time [2021-08-30 17:04:35,063 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [1220 Valid, 35 Invalid, 3568 Unknown, 0 Unchecked, 15.52ms Time], IncrementalHoareTripleChecker [581 Valid, 2627 Invalid, 0 Unknown, 360 Unchecked, 1677.42ms Time] [2021-08-30 17:04:35,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22628 states. [2021-08-30 17:04:35,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22628 to 21795. [2021-08-30 17:04:35,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21795 states, 17502 states have (on average 1.2416295280539367) internal successors, (21731), 19364 states have internal predecessors, (21731), 1608 states have call successors, (1608), 1590 states have call predecessors, (1608), 2674 states have return successors, (3962), 841 states have call predecessors, (3962), 1607 states have call successors, (3962) [2021-08-30 17:04:35,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21795 states to 21795 states and 27301 transitions. [2021-08-30 17:04:35,374 INFO L78 Accepts]: Start accepts. Automaton has 21795 states and 27301 transitions. Word has length 95 [2021-08-30 17:04:35,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:04:35,375 INFO L470 AbstractCegarLoop]: Abstraction has 21795 states and 27301 transitions. [2021-08-30 17:04:35,375 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 4.576923076923077) internal successors, (119), 24 states have internal predecessors, (119), 7 states have call successors, (17), 13 states have call predecessors, (17), 15 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2021-08-30 17:04:35,375 INFO L276 IsEmpty]: Start isEmpty. Operand 21795 states and 27301 transitions. [2021-08-30 17:04:35,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-08-30 17:04:35,379 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:04:35,379 INFO L513 BasicCegarLoop]: trace histogram [10, 9, 8, 6, 6, 6, 6, 6, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:04:35,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-08-30 17:04:35,582 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:04:35,582 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr5ENSURES_VIOLATIONMEMORY_LEAK === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-30 17:04:35,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:04:35,583 INFO L82 PathProgramCache]: Analyzing trace with hash 756702157, now seen corresponding path program 1 times [2021-08-30 17:04:35,583 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:04:35,583 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953561206] [2021-08-30 17:04:35,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:04:35,583 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:04:35,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:04:35,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:04:35,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:04:35,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-30 17:04:35,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:04:35,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-30 17:04:35,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:04:35,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-08-30 17:04:35,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:04:35,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-08-30 17:04:35,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:04:35,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-08-30 17:04:35,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:04:35,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-08-30 17:04:35,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:04:35,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-08-30 17:04:35,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:04:35,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-08-30 17:04:35,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:04:35,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-08-30 17:04:35,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:04:35,793 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 97 proven. 4 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2021-08-30 17:04:35,793 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:04:35,793 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953561206] [2021-08-30 17:04:35,793 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953561206] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:04:35,794 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465615062] [2021-08-30 17:04:35,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:04:35,794 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:04:35,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:04:35,797 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:04:35,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-08-30 17:04:36,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:04:36,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 858 conjuncts, 30 conjunts are in the unsatisfiable core [2021-08-30 17:04:36,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:04:36,326 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 91 proven. 62 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2021-08-30 17:04:36,326 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:04:36,714 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 61 proven. 68 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2021-08-30 17:04:36,714 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465615062] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:04:36,714 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:04:36,714 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 13] total 24 [2021-08-30 17:04:36,715 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17193345] [2021-08-30 17:04:36,715 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-08-30 17:04:36,715 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:04:36,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-08-30 17:04:36,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2021-08-30 17:04:36,716 INFO L87 Difference]: Start difference. First operand 21795 states and 27301 transitions. Second operand has 24 states, 24 states have (on average 4.916666666666667) internal successors, (118), 17 states have internal predecessors, (118), 6 states have call successors, (18), 10 states have call predecessors, (18), 9 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) [2021-08-30 17:04:39,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:04:39,478 INFO L93 Difference]: Finished difference Result 29416 states and 36370 transitions. [2021-08-30 17:04:39,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-08-30 17:04:39,479 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.916666666666667) internal successors, (118), 17 states have internal predecessors, (118), 6 states have call successors, (18), 10 states have call predecessors, (18), 9 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) Word has length 118 [2021-08-30 17:04:39,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:04:39,543 INFO L225 Difference]: With dead ends: 29416 [2021-08-30 17:04:39,543 INFO L226 Difference]: Without dead ends: 28702 [2021-08-30 17:04:39,544 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1031 ImplicationChecksByTransitivity, 1776.95ms TimeCoverageRelationStatistics Valid=779, Invalid=3511, Unknown=0, NotChecked=0, Total=4290 [2021-08-30 17:04:39,544 INFO L928 BasicCegarLoop]: 13 mSDtfsCounter, 1262 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 2020 mSolverCounterSat, 618 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 837.42ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1262 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 2638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 10.36ms SdHoareTripleChecker+Time, 618 IncrementalHoareTripleChecker+Valid, 2020 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1003.43ms IncrementalHoareTripleChecker+Time [2021-08-30 17:04:39,544 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [1262 Valid, 22 Invalid, 2638 Unknown, 0 Unchecked, 10.36ms Time], IncrementalHoareTripleChecker [618 Valid, 2020 Invalid, 0 Unknown, 0 Unchecked, 1003.43ms Time] [2021-08-30 17:04:39,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28702 states. [2021-08-30 17:04:39,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28702 to 27177. [2021-08-30 17:04:39,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27177 states, 21680 states have (on average 1.2214483394833948) internal successors, (26481), 24067 states have internal predecessors, (26481), 2142 states have call successors, (2142), 1991 states have call predecessors, (2142), 3344 states have return successors, (5115), 1119 states have call predecessors, (5115), 2141 states have call successors, (5115) [2021-08-30 17:04:39,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27177 states to 27177 states and 33738 transitions. [2021-08-30 17:04:39,885 INFO L78 Accepts]: Start accepts. Automaton has 27177 states and 33738 transitions. Word has length 118 [2021-08-30 17:04:39,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:04:39,886 INFO L470 AbstractCegarLoop]: Abstraction has 27177 states and 33738 transitions. [2021-08-30 17:04:39,886 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.916666666666667) internal successors, (118), 17 states have internal predecessors, (118), 6 states have call successors, (18), 10 states have call predecessors, (18), 9 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) [2021-08-30 17:04:39,886 INFO L276 IsEmpty]: Start isEmpty. Operand 27177 states and 33738 transitions. [2021-08-30 17:04:39,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2021-08-30 17:04:39,891 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:04:39,892 INFO L513 BasicCegarLoop]: trace histogram [11, 10, 9, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:04:39,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-08-30 17:04:40,104 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:04:40,105 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr5ENSURES_VIOLATIONMEMORY_LEAK === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-30 17:04:40,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:04:40,105 INFO L82 PathProgramCache]: Analyzing trace with hash -607088145, now seen corresponding path program 1 times [2021-08-30 17:04:40,105 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:04:40,106 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148147945] [2021-08-30 17:04:40,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:04:40,106 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:04:40,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-30 17:04:40,158 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-30 17:04:40,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-30 17:04:40,263 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-30 17:04:40,264 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-08-30 17:04:40,265 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location mainErr5ENSURES_VIOLATIONMEMORY_LEAK (19 of 20 remaining) [2021-08-30 17:04:40,266 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location pushErr0REQUIRES_VIOLATION (18 of 20 remaining) [2021-08-30 17:04:40,267 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location pushErr1REQUIRES_VIOLATION (17 of 20 remaining) [2021-08-30 17:04:40,267 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location pushErr2REQUIRES_VIOLATION (16 of 20 remaining) [2021-08-30 17:04:40,267 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location pushErr3REQUIRES_VIOLATION (15 of 20 remaining) [2021-08-30 17:04:40,267 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location pushErr4REQUIRES_VIOLATION (14 of 20 remaining) [2021-08-30 17:04:40,267 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location pushErr5REQUIRES_VIOLATION (13 of 20 remaining) [2021-08-30 17:04:40,267 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location pushErr6REQUIRES_VIOLATION (12 of 20 remaining) [2021-08-30 17:04:40,267 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location pushErr7REQUIRES_VIOLATION (11 of 20 remaining) [2021-08-30 17:04:40,268 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location popErr0REQUIRES_VIOLATION (10 of 20 remaining) [2021-08-30 17:04:40,268 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location popErr1REQUIRES_VIOLATION (9 of 20 remaining) [2021-08-30 17:04:40,268 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location popErr2REQUIRES_VIOLATION (8 of 20 remaining) [2021-08-30 17:04:40,268 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location popErr3REQUIRES_VIOLATION (7 of 20 remaining) [2021-08-30 17:04:40,268 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location popErr4REQUIRES_VIOLATION (6 of 20 remaining) [2021-08-30 17:04:40,268 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location popErr5REQUIRES_VIOLATION (5 of 20 remaining) [2021-08-30 17:04:40,268 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr0REQUIRES_VIOLATION (4 of 20 remaining) [2021-08-30 17:04:40,269 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr1REQUIRES_VIOLATION (3 of 20 remaining) [2021-08-30 17:04:40,269 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr2ASSERT_VIOLATIONMEMORY_FREE (2 of 20 remaining) [2021-08-30 17:04:40,269 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr3ASSERT_VIOLATIONMEMORY_FREE (1 of 20 remaining) [2021-08-30 17:04:40,269 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr4ASSERT_VIOLATIONMEMORY_FREE (0 of 20 remaining) [2021-08-30 17:04:40,269 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-08-30 17:04:40,275 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-30 17:04:40,316 WARN L418 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2021-08-30 17:04:40,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 05:04:40 BoogieIcfgContainer [2021-08-30 17:04:40,384 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-30 17:04:40,385 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-30 17:04:40,385 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-30 17:04:40,385 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-30 17:04:40,386 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 05:03:22" (3/4) ... [2021-08-30 17:04:40,388 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-30 17:04:40,388 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-30 17:04:40,389 INFO L158 Benchmark]: Toolchain (without parser) took 78606.97ms. Allocated memory was 52.4MB in the beginning and 9.2GB in the end (delta: 9.2GB). Free memory was 28.6MB in the beginning and 7.8GB in the end (delta: -7.8GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2021-08-30 17:04:40,389 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 52.4MB. Free memory was 34.4MB in the beginning and 34.3MB in the end (delta: 46.3kB). There was no memory consumed. Max. memory is 16.1GB. [2021-08-30 17:04:40,389 INFO L158 Benchmark]: CACSL2BoogieTranslator took 365.51ms. Allocated memory was 52.4MB in the beginning and 67.1MB in the end (delta: 14.7MB). Free memory was 28.4MB in the beginning and 43.8MB in the end (delta: -15.4MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. [2021-08-30 17:04:40,390 INFO L158 Benchmark]: Boogie Preprocessor took 60.27ms. Allocated memory is still 67.1MB. Free memory was 43.6MB in the beginning and 40.9MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-08-30 17:04:40,390 INFO L158 Benchmark]: RCFGBuilder took 498.89ms. Allocated memory is still 67.1MB. Free memory was 40.7MB in the beginning and 34.2MB in the end (delta: 6.5MB). Peak memory consumption was 11.3MB. Max. memory is 16.1GB. [2021-08-30 17:04:40,390 INFO L158 Benchmark]: TraceAbstraction took 77670.92ms. Allocated memory was 67.1MB in the beginning and 9.2GB in the end (delta: 9.2GB). Free memory was 33.9MB in the beginning and 7.8GB in the end (delta: -7.8GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2021-08-30 17:04:40,390 INFO L158 Benchmark]: Witness Printer took 3.70ms. Allocated memory is still 9.2GB. Free memory was 7.8GB in the beginning and 7.8GB in the end (delta: 2.7kB). There was no memory consumed. Max. memory is 16.1GB. [2021-08-30 17:04:40,391 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.21ms. Allocated memory is still 52.4MB. Free memory was 34.4MB in the beginning and 34.3MB in the end (delta: 46.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 365.51ms. Allocated memory was 52.4MB in the beginning and 67.1MB in the end (delta: 14.7MB). Free memory was 28.4MB in the beginning and 43.8MB in the end (delta: -15.4MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.27ms. Allocated memory is still 67.1MB. Free memory was 43.6MB in the beginning and 40.9MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 498.89ms. Allocated memory is still 67.1MB. Free memory was 40.7MB in the beginning and 34.2MB in the end (delta: 6.5MB). Peak memory consumption was 11.3MB. Max. memory is 16.1GB. * TraceAbstraction took 77670.92ms. Allocated memory was 67.1MB in the beginning and 9.2GB in the end (delta: 9.2GB). Free memory was 33.9MB in the beginning and 7.8GB in the end (delta: -7.8GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. * Witness Printer took 3.70ms. Allocated memory is still 9.2GB. Free memory was 7.8GB in the beginning and 7.8GB in the end (delta: 2.7kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.00ms ErrorAutomatonConstructionTimeTotal, 0.00ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.00ms ErrorAutomatonConstructionTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 592]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 592. Possible FailurePath: [L528] struct cell *S; [L529] int pc1 = 1; [L530] int pc4 = 1; [L531] static struct cell *t1 = ((void *)0); [L532] static struct cell *x1 = ((void *)0); [L561] struct cell* garbage; [L562] static struct cell *t4 = ((void *)0); [L563] static struct cell *x4 = ((void *)0); [L566] static int res4; VAL [\old(garbage)=54, \old(garbage)=49, \old(pc1)=67, \old(pc4)=50, \old(res4)=60, \old(S)=57, \old(S)=55, \old(t1)=70, \old(t1)=62, \old(t4)=53, \old(t4)=58, \old(x1)=61, \old(x1)=74, \old(x4)=68, \old(x4)=51, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L594] S || 1 != pc1 || __VERIFIER_nondet_int() [L594] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, __VERIFIER_nondet_int()=1, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L535] pc1++ [L536] case 1: [L537] x1 = malloc(sizeof(*x1)) [L538] x1->data = 0 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L539] x1->next = ((void *)0) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L596] RET push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L594] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=2, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=-1, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L535] pc1++ [L536] case 1: [L541] case 2: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=2, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=-1, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc1++=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L542] x1->data = 4 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=2, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=-1, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc1++=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L596] RET push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L594] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc4=1, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=3, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=-1, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L535] pc1++ [L536] case 1: [L541] case 2: [L544] case 3: [L545] t1 = S VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=3, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=-1, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc1++=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L596] RET push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L594] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc4=1, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=4, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=-1, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L535] pc1++ [L536] case 1: [L541] case 2: [L544] case 3: [L547] case 4: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=4, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=-1, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc1++=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L548] x1->next = t1 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=4, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=-1, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc1++=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L596] RET push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L594] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc4=1, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=5, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=-1, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L535] pc1++ [L536] case 1: [L541] case 2: [L544] case 3: [L547] case 4: [L550] case 5: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=5, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=-1, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L551] COND TRUE S == t1 [L552] S = x1 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=5, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=-1, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={-1:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L596] RET push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=1, res4=0, S={-1:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L594] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=1, res4=0, S={-1:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND FALSE !(__VERIFIER_nondet_int()) [L598] CALL pop() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=-1, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=1, res4=0, S={-1:0}, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L567] pc4++ [L568] case 1: [L569] t4 = S VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=-1, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=2, pc4++=1, res4=0, S={-1:0}, t1={0:0}, t4={-1:0}, x1={-1:0}, x4={0:0}] [L598] RET pop() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=2, res4=0, S={-1:0}, t1={0:0}, t4={-1:0}, x1={-1:0}, x4={0:0}] [L594] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=2, res4=0, S={-1:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={-1:0}, x1={-1:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND FALSE !(__VERIFIER_nondet_int()) [L598] CALL pop() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=2, \old(res4)=0, \old(S)=0, \old(S)=-1, \old(t1)=0, \old(t1)=0, \old(t4)=-1, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=2, res4=0, S={-1:0}, t1={0:0}, t4={-1:0}, x1={-1:0}, x4={0:0}] [L567] pc4++ [L568] case 1: [L571] case 2: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=2, \old(res4)=0, \old(S)=0, \old(S)=-1, \old(t1)=0, \old(t1)=0, \old(t4)=-1, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=3, pc4++=2, res4=0, S={-1:0}, t1={0:0}, t4={-1:0}, x1={-1:0}, x4={0:0}] [L572] COND FALSE !(t4 == ((void *)0)) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=2, \old(res4)=0, \old(S)=0, \old(S)=-1, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=-1, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=3, pc4++=2, res4=0, S={-1:0}, t1={0:0}, t4={-1:0}, x1={-1:0}, x4={0:0}] [L598] RET pop() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=3, res4=0, S={-1:0}, t1={0:0}, t4={-1:0}, x1={-1:0}, x4={0:0}] [L594] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=3, res4=0, S={-1:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={-1:0}, x1={-1:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND FALSE !(__VERIFIER_nondet_int()) [L598] CALL pop() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=3, \old(res4)=0, \old(S)=0, \old(S)=-1, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=-1, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=3, res4=0, S={-1:0}, t1={0:0}, t4={-1:0}, x1={-1:0}, x4={0:0}] [L567] pc4++ [L568] case 1: [L571] case 2: [L575] case 3: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=3, \old(res4)=0, \old(S)=-1, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=-1, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=4, pc4++=3, res4=0, S={-1:0}, t1={0:0}, t4={-1:0}, x1={-1:0}, x4={0:0}] [L576] EXPR t4->next VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=3, \old(res4)=0, \old(S)=0, \old(S)=-1, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=-1, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=4, pc4++=3, res4=0, S={-1:0}, t1={0:0}, t4={-1:0}, t4->next={0:0}, x1={-1:0}, x4={0:0}] [L576] x4 = t4->next [L598] RET pop() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=4, res4=0, S={-1:0}, t1={0:0}, t4={-1:0}, x1={-1:0}, x4={0:0}] [L594] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=4, res4=0, S={-1:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={-1:0}, x1={-1:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND FALSE !(__VERIFIER_nondet_int()) [L598] CALL pop() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=4, \old(res4)=0, \old(S)=-1, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=-1, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=4, res4=0, S={-1:0}, t1={0:0}, t4={-1:0}, x1={-1:0}, x4={0:0}] [L567] pc4++ [L568] case 1: [L571] case 2: [L575] case 3: [L578] case 4: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=4, \old(res4)=0, \old(S)=0, \old(S)=-1, \old(t1)=0, \old(t1)=0, \old(t4)=-1, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=5, pc4++=4, res4=0, S={-1:0}, t1={0:0}, t4={-1:0}, x1={-1:0}, x4={0:0}] [L579] COND TRUE S == t4 [L580] S = x4 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=4, \old(res4)=0, \old(S)=-1, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=-1, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=5, pc4++=4, res4=0, S={0:0}, t1={0:0}, t4={-1:0}, x1={-1:0}, x4={0:0}] [L598] RET pop() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=5, res4=0, S={0:0}, t1={0:0}, t4={-1:0}, x1={-1:0}, x4={0:0}] [L594] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=5, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={-1:0}, x1={-1:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=-1, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=5, res4=0, S={0:0}, t1={0:0}, t4={-1:0}, x1={-1:0}, x4={0:0}] [L535] pc1++ [L536] case 1: [L541] case 2: [L544] case 3: [L547] case 4: [L550] case 5: [L556] case 6: [L557] pc1 = 1 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=-1, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc1++=6, pc4=5, res4=0, S={0:0}, t1={0:0}, t4={-1:0}, x1={-1:0}, x4={0:0}] [L596] RET push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=5, res4=0, S={0:0}, t1={0:0}, t4={-1:0}, x1={-1:0}, x4={0:0}] [L594] S || 1 != pc1 || __VERIFIER_nondet_int() [L594] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, __VERIFIER_nondet_int()=0, garbage={0:0}, pc1=1, pc4=5, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=0, t1={0:0}, t4={-1:0}, x1={-1:0}, x4={0:0}] [L594] COND FALSE !(S || 1 != pc1 || __VERIFIER_nondet_int()) [L600] COND FALSE !(\read(*garbage)) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=5, res4=0, S={0:0}, t1={0:0}, t4={-1:0}, x1={-1:0}, x4={0:0}] [L605] S = ((void *)0) [L606] t1 = ((void *)0) [L607] x1 = ((void *)0) [L608] t4 = ((void *)0) [L609] x4 = ((void *)0) [L610] return !!garbage; VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, \result=0, garbage={0:0}, pc1=1, pc4=5, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] - UnprovableResult [Line: 538]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 539]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 539]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 542]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 542]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 548]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 548]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 576]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 576]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 585]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 585]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 586]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 586]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 601]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 601]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 92 locations, 20 error locations. Started 1 CEGAR loops. OverallTime: 77502.70ms, OverallIterations: 25, TraceHistogramMax: 11, EmptinessCheckTime: 92.04ms, AutomataDifference: 46893.25ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 0.00ms, InitialAbstractionConstructionTime: 35.45ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 13425 SdHoareTripleChecker+Valid, 19617.68ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13368 mSDsluCounter, 657 SdHoareTripleChecker+Invalid, 16106.26ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 360 IncrementalHoareTripleChecker+Unchecked, 6827 mSDsCounter, 6144 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 33901 IncrementalHoareTripleChecker+Invalid, 40405 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6144 mSolverCounterUnsat, 287 mSDtfsCounter, 33901 mSolverCounterSat, 206.11ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3392 GetRequests, 2298 SyntacticMatches, 78 SemanticMatches, 1016 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46090 ImplicationChecksByTransitivity, 25712.84ms Time, 0.00ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=58057occurred in iteration=18, InterpolantAutomatonStates: 834, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.00ms DumpTime, AutomataMinimizationStatistics: 10410.69ms AutomataMinimizationTime, 24 MinimizatonAttempts, 73031 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 613.12ms SsaConstructionTime, 1431.36ms SatisfiabilityAnalysisTime, 13025.33ms InterpolantComputationTime, 2272 NumberOfCodeBlocks, 2272 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 3104 ConstructedInterpolants, 10 QuantifiedInterpolants, 14722 SizeOfPredicates, 82 NumberOfNonLiveVariables, 8647 ConjunctsInSsa, 322 ConjunctsInUnsatCore, 54 InterpolantComputations, 9 PerfectInterpolantSequences, 4103/5319 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-30 17:04:40,442 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-wip.dd.seqcomp-5fbdf5b [2021-08-30 17:04:42,493 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-30 17:04:42,495 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-30 17:04:42,521 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-30 17:04:42,521 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-30 17:04:42,522 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-30 17:04:42,523 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-30 17:04:42,525 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-30 17:04:42,526 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-30 17:04:42,527 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-30 17:04:42,528 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-30 17:04:42,529 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-30 17:04:42,529 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-30 17:04:42,530 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-30 17:04:42,531 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-30 17:04:42,532 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-30 17:04:42,533 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-30 17:04:42,534 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-30 17:04:42,535 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-30 17:04:42,536 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-30 17:04:42,538 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-30 17:04:42,538 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-30 17:04:42,539 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-30 17:04:42,540 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-30 17:04:42,542 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-30 17:04:42,543 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-30 17:04:42,543 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-30 17:04:42,544 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-30 17:04:42,544 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-30 17:04:42,545 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-30 17:04:42,545 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-30 17:04:42,546 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-30 17:04:42,546 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-30 17:04:42,547 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-30 17:04:42,548 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-30 17:04:42,548 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-30 17:04:42,549 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-30 17:04:42,549 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-30 17:04:42,549 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-30 17:04:42,550 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-30 17:04:42,550 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-30 17:04:42,551 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-08-30 17:04:42,571 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-30 17:04:42,572 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-30 17:04:42,572 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-30 17:04:42,572 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-30 17:04:42,573 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-30 17:04:42,574 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-30 17:04:42,574 INFO L138 SettingsManager]: * Use SBE=true [2021-08-30 17:04:42,574 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-30 17:04:42,574 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-30 17:04:42,575 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-30 17:04:42,575 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-30 17:04:42,575 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-30 17:04:42,575 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-30 17:04:42,575 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-08-30 17:04:42,576 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-08-30 17:04:42,576 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-08-30 17:04:42,576 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-30 17:04:42,576 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-08-30 17:04:42,577 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-08-30 17:04:42,577 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-08-30 17:04:42,577 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-30 17:04:42,577 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-30 17:04:42,578 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-30 17:04:42,578 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-30 17:04:42,578 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-30 17:04:42,578 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-30 17:04:42,579 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-30 17:04:42,579 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-30 17:04:42,579 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-08-30 17:04:42,579 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-08-30 17:04:42,579 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-30 17:04:42,580 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-08-30 17:04:42,580 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 -> 39b25c4e2cc4769f7c060343bf6a1efac7abb2b9 [2021-08-30 17:04:42,867 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-30 17:04:42,904 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-30 17:04:42,907 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-30 17:04:42,908 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-30 17:04:42,908 INFO L275 PluginConnector]: CDTParser initialized [2021-08-30 17:04:42,910 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/lockfree-3.3.i [2021-08-30 17:04:42,976 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09d8890ed/cf06f8ec21e6422b912c7d31aca9a63b/FLAGab4b5d80b [2021-08-30 17:04:43,541 INFO L306 CDTParser]: Found 1 translation units. [2021-08-30 17:04:43,542 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/lockfree-3.3.i [2021-08-30 17:04:43,558 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09d8890ed/cf06f8ec21e6422b912c7d31aca9a63b/FLAGab4b5d80b [2021-08-30 17:04:43,956 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09d8890ed/cf06f8ec21e6422b912c7d31aca9a63b [2021-08-30 17:04:43,959 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-30 17:04:43,961 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-30 17:04:43,962 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-30 17:04:43,962 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-30 17:04:43,965 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-30 17:04:43,965 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 05:04:43" (1/1) ... [2021-08-30 17:04:43,966 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f7f55be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:04:43, skipping insertion in model container [2021-08-30 17:04:43,966 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 05:04:43" (1/1) ... [2021-08-30 17:04:43,971 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-30 17:04:44,004 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-30 17:04:44,305 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-30 17:04:44,318 INFO L203 MainTranslator]: Completed pre-run [2021-08-30 17:04:44,354 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-30 17:04:44,388 INFO L208 MainTranslator]: Completed translation [2021-08-30 17:04:44,389 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:04:44 WrapperNode [2021-08-30 17:04:44,389 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-30 17:04:44,392 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-30 17:04:44,392 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-30 17:04:44,392 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-30 17:04:44,400 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:04:44" (1/1) ... [2021-08-30 17:04:44,401 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:04:44" (1/1) ... [2021-08-30 17:04:44,429 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:04:44" (1/1) ... [2021-08-30 17:04:44,429 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:04:44" (1/1) ... [2021-08-30 17:04:44,446 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:04:44" (1/1) ... [2021-08-30 17:04:44,456 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:04:44" (1/1) ... [2021-08-30 17:04:44,463 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:04:44" (1/1) ... [2021-08-30 17:04:44,475 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-30 17:04:44,476 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-30 17:04:44,476 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-30 17:04:44,477 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-30 17:04:44,477 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:04:44" (1/1) ... [2021-08-30 17:04:44,487 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-30 17:04:44,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:04:44,510 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-30 17:04:44,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-30 17:04:44,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-08-30 17:04:44,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-30 17:04:44,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2021-08-30 17:04:44,540 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-08-30 17:04:44,540 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2021-08-30 17:04:44,541 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2021-08-30 17:04:44,541 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2021-08-30 17:04:44,541 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2021-08-30 17:04:44,542 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2021-08-30 17:04:44,542 INFO L138 BoogieDeclarations]: Found implementation of procedure push [2021-08-30 17:04:44,542 INFO L138 BoogieDeclarations]: Found implementation of procedure pop [2021-08-30 17:04:44,542 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-08-30 17:04:44,542 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-08-30 17:04:44,543 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-08-30 17:04:44,543 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-08-30 17:04:44,543 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-08-30 17:04:44,543 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-08-30 17:04:44,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-30 17:04:44,546 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2021-08-30 17:04:44,546 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2021-08-30 17:04:44,547 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2021-08-30 17:04:44,547 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2021-08-30 17:04:44,547 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2021-08-30 17:04:44,547 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2021-08-30 17:04:44,547 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2021-08-30 17:04:44,547 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2021-08-30 17:04:44,547 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2021-08-30 17:04:44,547 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2021-08-30 17:04:44,547 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2021-08-30 17:04:44,547 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2021-08-30 17:04:44,547 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2021-08-30 17:04:44,547 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2021-08-30 17:04:44,547 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2021-08-30 17:04:44,548 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2021-08-30 17:04:44,548 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2021-08-30 17:04:44,548 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2021-08-30 17:04:44,548 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2021-08-30 17:04:44,548 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2021-08-30 17:04:44,548 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2021-08-30 17:04:44,548 INFO L130 BoogieDeclarations]: Found specification of procedure select [2021-08-30 17:04:44,548 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2021-08-30 17:04:44,548 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2021-08-30 17:04:44,548 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2021-08-30 17:04:44,548 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2021-08-30 17:04:44,549 INFO L130 BoogieDeclarations]: Found specification of procedure random [2021-08-30 17:04:44,549 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2021-08-30 17:04:44,549 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2021-08-30 17:04:44,549 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2021-08-30 17:04:44,549 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2021-08-30 17:04:44,549 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2021-08-30 17:04:44,549 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2021-08-30 17:04:44,549 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2021-08-30 17:04:44,549 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2021-08-30 17:04:44,549 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2021-08-30 17:04:44,549 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2021-08-30 17:04:44,550 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2021-08-30 17:04:44,550 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2021-08-30 17:04:44,550 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2021-08-30 17:04:44,550 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2021-08-30 17:04:44,550 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2021-08-30 17:04:44,550 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2021-08-30 17:04:44,550 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2021-08-30 17:04:44,550 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2021-08-30 17:04:44,550 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2021-08-30 17:04:44,550 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2021-08-30 17:04:44,551 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2021-08-30 17:04:44,551 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2021-08-30 17:04:44,551 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2021-08-30 17:04:44,551 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2021-08-30 17:04:44,551 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2021-08-30 17:04:44,551 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2021-08-30 17:04:44,551 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2021-08-30 17:04:44,551 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2021-08-30 17:04:44,551 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-08-30 17:04:44,551 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-08-30 17:04:44,552 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2021-08-30 17:04:44,552 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-08-30 17:04:44,552 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2021-08-30 17:04:44,552 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2021-08-30 17:04:44,552 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2021-08-30 17:04:44,552 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2021-08-30 17:04:44,552 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2021-08-30 17:04:44,552 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2021-08-30 17:04:44,552 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2021-08-30 17:04:44,552 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2021-08-30 17:04:44,553 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2021-08-30 17:04:44,553 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2021-08-30 17:04:44,553 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2021-08-30 17:04:44,553 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2021-08-30 17:04:44,553 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2021-08-30 17:04:44,553 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2021-08-30 17:04:44,553 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2021-08-30 17:04:44,553 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2021-08-30 17:04:44,553 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2021-08-30 17:04:44,553 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2021-08-30 17:04:44,554 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2021-08-30 17:04:44,554 INFO L130 BoogieDeclarations]: Found specification of procedure system [2021-08-30 17:04:44,554 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2021-08-30 17:04:44,554 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2021-08-30 17:04:44,562 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2021-08-30 17:04:44,562 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2021-08-30 17:04:44,562 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2021-08-30 17:04:44,562 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2021-08-30 17:04:44,562 INFO L130 BoogieDeclarations]: Found specification of procedure div [2021-08-30 17:04:44,562 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2021-08-30 17:04:44,562 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2021-08-30 17:04:44,562 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2021-08-30 17:04:44,562 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2021-08-30 17:04:44,563 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2021-08-30 17:04:44,563 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2021-08-30 17:04:44,563 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2021-08-30 17:04:44,563 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2021-08-30 17:04:44,563 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2021-08-30 17:04:44,563 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2021-08-30 17:04:44,563 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2021-08-30 17:04:44,563 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2021-08-30 17:04:44,563 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2021-08-30 17:04:44,563 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2021-08-30 17:04:44,564 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2021-08-30 17:04:44,564 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2021-08-30 17:04:44,564 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2021-08-30 17:04:44,564 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2021-08-30 17:04:44,564 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2021-08-30 17:04:44,564 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2021-08-30 17:04:44,564 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-08-30 17:04:44,564 INFO L130 BoogieDeclarations]: Found specification of procedure push [2021-08-30 17:04:44,564 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-08-30 17:04:44,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-08-30 17:04:44,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-30 17:04:44,565 INFO L130 BoogieDeclarations]: Found specification of procedure pop [2021-08-30 17:04:44,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-30 17:04:44,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-08-30 17:04:44,565 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-08-30 17:04:44,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-30 17:04:44,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-08-30 17:04:44,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-08-30 17:04:44,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-30 17:04:44,566 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2021-08-30 17:04:44,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2021-08-30 17:04:44,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-08-30 17:04:44,912 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-30 17:04:44,918 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2021-08-30 17:04:44,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 05:04:44 BoogieIcfgContainer [2021-08-30 17:04:44,921 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-30 17:04:44,922 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-30 17:04:44,922 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-30 17:04:44,924 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-30 17:04:44,925 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 05:04:43" (1/3) ... [2021-08-30 17:04:44,925 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c7001e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 05:04:44, skipping insertion in model container [2021-08-30 17:04:44,925 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:04:44" (2/3) ... [2021-08-30 17:04:44,925 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c7001e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 05:04:44, skipping insertion in model container [2021-08-30 17:04:44,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 05:04:44" (3/3) ... [2021-08-30 17:04:44,927 INFO L111 eAbstractionObserver]: Analyzing ICFG lockfree-3.3.i [2021-08-30 17:04:44,931 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-30 17:04:44,931 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2021-08-30 17:04:44,979 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-30 17:04:44,993 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-30 17:04:44,993 INFO L340 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2021-08-30 17:04:45,008 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 43 states have (on average 1.9069767441860466) internal successors, (82), 65 states have internal predecessors, (82), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2021-08-30 17:04:45,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-08-30 17:04:45,025 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:04:45,025 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:04:45,026 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr1REQUIRES_VIOLATION === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-30 17:04:45,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:04:45,031 INFO L82 PathProgramCache]: Analyzing trace with hash 913050877, now seen corresponding path program 1 times [2021-08-30 17:04:45,041 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-30 17:04:45,042 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [397033839] [2021-08-30 17:04:45,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:04:45,042 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-30 17:04:45,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-30 17:04:45,050 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-30 17:04:45,071 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-30 17:04:45,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:04:45,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 1 conjunts are in the unsatisfiable core [2021-08-30 17:04:45,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:04:45,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 17:04:45,309 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:04:45,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 17:04:45,349 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-30 17:04:45,349 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [397033839] [2021-08-30 17:04:45,350 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [397033839] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-30 17:04:45,350 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-30 17:04:45,350 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-08-30 17:04:45,352 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376400818] [2021-08-30 17:04:45,356 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-08-30 17:04:45,357 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-30 17:04:45,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-08-30 17:04:45,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-30 17:04:45,385 INFO L87 Difference]: Start difference. First operand has 72 states, 43 states have (on average 1.9069767441860466) internal successors, (82), 65 states have internal predecessors, (82), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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-30 17:04:45,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:04:45,581 INFO L93 Difference]: Finished difference Result 72 states and 88 transitions. [2021-08-30 17:04:45,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-08-30 17:04:45,583 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 8 [2021-08-30 17:04:45,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:04:45,590 INFO L225 Difference]: With dead ends: 72 [2021-08-30 17:04:45,591 INFO L226 Difference]: Without dead ends: 69 [2021-08-30 17:04:45,592 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.10ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-30 17:04:45,597 INFO L928 BasicCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 126.41ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.15ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 169.94ms IncrementalHoareTripleChecker+Time [2021-08-30 17:04:45,598 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 8 Invalid, 80 Unknown, 0 Unchecked, 2.15ms Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 169.94ms Time] [2021-08-30 17:04:45,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2021-08-30 17:04:45,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2021-08-30 17:04:45,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 42 states have (on average 1.8571428571428572) internal successors, (78), 63 states have internal predecessors, (78), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-30 17:04:45,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 85 transitions. [2021-08-30 17:04:45,645 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 85 transitions. Word has length 8 [2021-08-30 17:04:45,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:04:45,645 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 85 transitions. [2021-08-30 17:04:45,646 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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-30 17:04:45,646 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 85 transitions. [2021-08-30 17:04:45,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-08-30 17:04:45,646 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:04:45,646 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:04:45,661 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-30 17:04:45,859 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-30 17:04:45,859 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr1REQUIRES_VIOLATION === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-30 17:04:45,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:04:45,860 INFO L82 PathProgramCache]: Analyzing trace with hash 913039345, now seen corresponding path program 1 times [2021-08-30 17:04:45,861 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-30 17:04:45,861 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1978095616] [2021-08-30 17:04:45,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:04:45,861 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-30 17:04:45,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-30 17:04:45,862 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-30 17:04:45,863 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-30 17:04:45,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:04:46,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 7 conjunts are in the unsatisfiable core [2021-08-30 17:04:46,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:04:46,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 17:04:46,112 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:04:46,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 17:04:46,212 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-30 17:04:46,213 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1978095616] [2021-08-30 17:04:46,213 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1978095616] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-30 17:04:46,213 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-30 17:04:46,213 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-08-30 17:04:46,213 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573798489] [2021-08-30 17:04:46,214 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-30 17:04:46,215 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-30 17:04:46,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-30 17:04:46,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-30 17:04:46,216 INFO L87 Difference]: Start difference. First operand 69 states and 85 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 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-30 17:04:46,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:04:46,541 INFO L93 Difference]: Finished difference Result 120 states and 153 transitions. [2021-08-30 17:04:46,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-30 17:04:46,542 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 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) Word has length 8 [2021-08-30 17:04:46,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:04:46,544 INFO L225 Difference]: With dead ends: 120 [2021-08-30 17:04:46,544 INFO L226 Difference]: Without dead ends: 120 [2021-08-30 17:04:46,544 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.33ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-30 17:04:46,545 INFO L928 BasicCegarLoop]: 9 mSDtfsCounter, 67 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 240.83ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.73ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 299.27ms IncrementalHoareTripleChecker+Time [2021-08-30 17:04:46,546 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 15 Invalid, 152 Unknown, 0 Unchecked, 2.73ms Time], IncrementalHoareTripleChecker [1 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 299.27ms Time] [2021-08-30 17:04:46,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2021-08-30 17:04:46,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 102. [2021-08-30 17:04:46,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 71 states have (on average 1.8732394366197183) internal successors, (133), 93 states have internal predecessors, (133), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2021-08-30 17:04:46,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 145 transitions. [2021-08-30 17:04:46,561 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 145 transitions. Word has length 8 [2021-08-30 17:04:46,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:04:46,561 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 145 transitions. [2021-08-30 17:04:46,562 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 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-30 17:04:46,562 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 145 transitions. [2021-08-30 17:04:46,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-08-30 17:04:46,562 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:04:46,563 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:04:46,575 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-30 17:04:46,774 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-30 17:04:46,775 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr5ENSURES_VIOLATIONMEMORY_LEAK === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-30 17:04:46,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:04:46,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1760552785, now seen corresponding path program 1 times [2021-08-30 17:04:46,776 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-30 17:04:46,776 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1024071504] [2021-08-30 17:04:46,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:04:46,776 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-30 17:04:46,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-30 17:04:46,777 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-30 17:04:46,781 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-30 17:04:46,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:04:46,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-30 17:04:46,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:04:46,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 17:04:46,938 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:04:46,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 17:04:46,976 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-30 17:04:46,977 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1024071504] [2021-08-30 17:04:46,977 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1024071504] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-30 17:04:46,977 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-30 17:04:46,977 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-08-30 17:04:46,977 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302059118] [2021-08-30 17:04:46,978 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-30 17:04:46,981 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-30 17:04:46,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-30 17:04:46,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-30 17:04:46,982 INFO L87 Difference]: Start difference. First operand 102 states and 145 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-30 17:04:47,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:04:47,213 INFO L93 Difference]: Finished difference Result 128 states and 182 transitions. [2021-08-30 17:04:47,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-30 17:04:47,214 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 9 [2021-08-30 17:04:47,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:04:47,215 INFO L225 Difference]: With dead ends: 128 [2021-08-30 17:04:47,215 INFO L226 Difference]: Without dead ends: 125 [2021-08-30 17:04:47,216 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.15ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-30 17:04:47,216 INFO L928 BasicCegarLoop]: 9 mSDtfsCounter, 64 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 161.78ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.68ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 209.96ms IncrementalHoareTripleChecker+Time [2021-08-30 17:04:47,217 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 11 Invalid, 118 Unknown, 0 Unchecked, 1.68ms Time], IncrementalHoareTripleChecker [6 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 209.96ms Time] [2021-08-30 17:04:47,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-08-30 17:04:47,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 115. [2021-08-30 17:04:47,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 78 states have (on average 1.8333333333333333) internal successors, (143), 104 states have internal predecessors, (143), 10 states have call successors, (10), 6 states have call predecessors, (10), 7 states have return successors, (15), 5 states have call predecessors, (15), 9 states have call successors, (15) [2021-08-30 17:04:47,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 168 transitions. [2021-08-30 17:04:47,228 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 168 transitions. Word has length 9 [2021-08-30 17:04:47,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:04:47,229 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 168 transitions. [2021-08-30 17:04:47,229 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-30 17:04:47,229 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 168 transitions. [2021-08-30 17:04:47,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-08-30 17:04:47,229 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:04:47,229 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:04:47,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-08-30 17:04:47,439 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-30 17:04:47,439 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting pushErr0REQUIRES_VIOLATION === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-30 17:04:47,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:04:47,440 INFO L82 PathProgramCache]: Analyzing trace with hash 370381771, now seen corresponding path program 1 times [2021-08-30 17:04:47,440 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-30 17:04:47,440 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1035478983] [2021-08-30 17:04:47,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:04:47,440 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-30 17:04:47,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-30 17:04:47,441 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-30 17:04:47,443 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-30 17:04:47,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:04:47,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-30 17:04:47,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:04:47,600 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-30 17:04:47,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 17:04:47,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:04:47,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 17:04:47,627 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-30 17:04:47,627 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1035478983] [2021-08-30 17:04:47,627 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1035478983] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-30 17:04:47,627 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-30 17:04:47,627 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-08-30 17:04:47,628 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412010286] [2021-08-30 17:04:47,628 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-30 17:04:47,628 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-30 17:04:47,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-30 17:04:47,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-30 17:04:47,629 INFO L87 Difference]: Start difference. First operand 115 states and 168 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-30 17:04:47,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:04:47,905 INFO L93 Difference]: Finished difference Result 198 states and 290 transitions. [2021-08-30 17:04:47,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-30 17:04:47,907 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2021-08-30 17:04:47,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:04:47,909 INFO L225 Difference]: With dead ends: 198 [2021-08-30 17:04:47,909 INFO L226 Difference]: Without dead ends: 198 [2021-08-30 17:04:47,909 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.25ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-30 17:04:47,910 INFO L928 BasicCegarLoop]: 11 mSDtfsCounter, 71 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 214.58ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.67ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 261.90ms IncrementalHoareTripleChecker+Time [2021-08-30 17:04:47,910 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 18 Invalid, 214 Unknown, 0 Unchecked, 3.67ms Time], IncrementalHoareTripleChecker [5 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 261.90ms Time] [2021-08-30 17:04:47,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-08-30 17:04:47,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 177. [2021-08-30 17:04:47,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 134 states have (on average 1.7761194029850746) internal successors, (238), 160 states have internal predecessors, (238), 14 states have call successors, (14), 10 states have call predecessors, (14), 11 states have return successors, (24), 7 states have call predecessors, (24), 13 states have call successors, (24) [2021-08-30 17:04:47,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 276 transitions. [2021-08-30 17:04:47,939 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 276 transitions. Word has length 11 [2021-08-30 17:04:47,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:04:47,939 INFO L470 AbstractCegarLoop]: Abstraction has 177 states and 276 transitions. [2021-08-30 17:04:47,940 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-30 17:04:47,940 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 276 transitions. [2021-08-30 17:04:47,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-08-30 17:04:47,940 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:04:47,940 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:04:47,951 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-30 17:04:48,148 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-30 17:04:48,148 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting pushErr1REQUIRES_VIOLATION === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-30 17:04:48,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:04:48,149 INFO L82 PathProgramCache]: Analyzing trace with hash 370381772, now seen corresponding path program 1 times [2021-08-30 17:04:48,149 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-30 17:04:48,149 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1077009443] [2021-08-30 17:04:48,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:04:48,149 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-30 17:04:48,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-30 17:04:48,150 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-30 17:04:48,152 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-30 17:04:48,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:04:48,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-30 17:04:48,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:04:48,307 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-30 17:04:48,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 17:04:48,318 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:04:48,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 17:04:48,369 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-30 17:04:48,369 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1077009443] [2021-08-30 17:04:48,369 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1077009443] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-30 17:04:48,369 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-30 17:04:48,369 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-08-30 17:04:48,369 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163876192] [2021-08-30 17:04:48,370 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-30 17:04:48,370 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-30 17:04:48,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-30 17:04:48,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-30 17:04:48,372 INFO L87 Difference]: Start difference. First operand 177 states and 276 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-30 17:04:48,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:04:48,891 INFO L93 Difference]: Finished difference Result 333 states and 499 transitions. [2021-08-30 17:04:48,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-30 17:04:48,892 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2021-08-30 17:04:48,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:04:48,895 INFO L225 Difference]: With dead ends: 333 [2021-08-30 17:04:48,895 INFO L226 Difference]: Without dead ends: 333 [2021-08-30 17:04:48,895 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.06ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-30 17:04:48,896 INFO L928 BasicCegarLoop]: 14 mSDtfsCounter, 203 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 415.64ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.42ms SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 499.19ms IncrementalHoareTripleChecker+Time [2021-08-30 17:04:48,896 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [203 Valid, 21 Invalid, 286 Unknown, 0 Unchecked, 4.42ms Time], IncrementalHoareTripleChecker [10 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 499.19ms Time] [2021-08-30 17:04:48,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2021-08-30 17:04:48,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 295. [2021-08-30 17:04:48,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 242 states have (on average 1.7314049586776858) internal successors, (419), 268 states have internal predecessors, (419), 18 states have call successors, (18), 18 states have call predecessors, (18), 19 states have return successors, (35), 9 states have call predecessors, (35), 17 states have call successors, (35) [2021-08-30 17:04:48,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 472 transitions. [2021-08-30 17:04:48,921 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 472 transitions. Word has length 11 [2021-08-30 17:04:48,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:04:48,922 INFO L470 AbstractCegarLoop]: Abstraction has 295 states and 472 transitions. [2021-08-30 17:04:48,922 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-30 17:04:48,922 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 472 transitions. [2021-08-30 17:04:48,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-30 17:04:48,922 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:04:48,923 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:04:48,933 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-08-30 17:04:49,131 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-30 17:04:49,132 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting pushErr4REQUIRES_VIOLATION === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-30 17:04:49,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:04:49,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1403059964, now seen corresponding path program 1 times [2021-08-30 17:04:49,132 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-30 17:04:49,132 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [509696811] [2021-08-30 17:04:49,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:04:49,133 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-30 17:04:49,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-30 17:04:49,134 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-30 17:04:49,135 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-30 17:04:49,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:04:49,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-30 17:04:49,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:04:49,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 17:04:49,282 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:04:49,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 17:04:49,333 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-30 17:04:49,333 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [509696811] [2021-08-30 17:04:49,333 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [509696811] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-30 17:04:49,334 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-30 17:04:49,334 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-08-30 17:04:49,334 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399452169] [2021-08-30 17:04:49,334 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-30 17:04:49,334 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-30 17:04:49,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-30 17:04:49,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-30 17:04:49,335 INFO L87 Difference]: Start difference. First operand 295 states and 472 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-30 17:04:49,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:04:49,538 INFO L93 Difference]: Finished difference Result 197 states and 283 transitions. [2021-08-30 17:04:49,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-30 17:04:49,540 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2021-08-30 17:04:49,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:04:49,541 INFO L225 Difference]: With dead ends: 197 [2021-08-30 17:04:49,541 INFO L226 Difference]: Without dead ends: 197 [2021-08-30 17:04:49,541 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.64ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-30 17:04:49,542 INFO L928 BasicCegarLoop]: 10 mSDtfsCounter, 55 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 155.18ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.44ms SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 188.05ms IncrementalHoareTripleChecker+Time [2021-08-30 17:04:49,542 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 26 Invalid, 192 Unknown, 0 Unchecked, 2.44ms Time], IncrementalHoareTripleChecker [9 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 188.05ms Time] [2021-08-30 17:04:49,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2021-08-30 17:04:49,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 181. [2021-08-30 17:04:49,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 144 states have (on average 1.6736111111111112) internal successors, (241), 162 states have internal predecessors, (241), 12 states have call successors, (12), 12 states have call predecessors, (12), 13 states have return successors, (18), 7 states have call predecessors, (18), 11 states have call successors, (18) [2021-08-30 17:04:49,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 271 transitions. [2021-08-30 17:04:49,552 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 271 transitions. Word has length 12 [2021-08-30 17:04:49,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:04:49,552 INFO L470 AbstractCegarLoop]: Abstraction has 181 states and 271 transitions. [2021-08-30 17:04:49,552 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-30 17:04:49,552 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 271 transitions. [2021-08-30 17:04:49,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-30 17:04:49,553 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:04:49,553 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:04:49,568 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-30 17:04:49,766 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-30 17:04:49,767 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting popErr0REQUIRES_VIOLATION === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-30 17:04:49,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:04:49,767 INFO L82 PathProgramCache]: Analyzing trace with hash -2074754906, now seen corresponding path program 1 times [2021-08-30 17:04:49,768 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-30 17:04:49,768 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2119569518] [2021-08-30 17:04:49,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:04:49,768 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-30 17:04:49,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-30 17:04:49,769 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-30 17:04:49,770 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-30 17:04:49,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:04:49,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-30 17:04:49,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:04:49,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 17:04:49,949 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:04:49,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 17:04:49,983 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-30 17:04:49,983 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2119569518] [2021-08-30 17:04:49,984 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2119569518] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-30 17:04:49,984 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-30 17:04:49,984 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-08-30 17:04:49,984 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879471966] [2021-08-30 17:04:49,984 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-30 17:04:49,984 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-30 17:04:49,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-30 17:04:49,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-30 17:04:49,985 INFO L87 Difference]: Start difference. First operand 181 states and 271 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-30 17:04:50,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:04:50,203 INFO L93 Difference]: Finished difference Result 297 states and 420 transitions. [2021-08-30 17:04:50,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-30 17:04:50,204 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2021-08-30 17:04:50,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:04:50,205 INFO L225 Difference]: With dead ends: 297 [2021-08-30 17:04:50,205 INFO L226 Difference]: Without dead ends: 297 [2021-08-30 17:04:50,206 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.93ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-30 17:04:50,206 INFO L928 BasicCegarLoop]: 9 mSDtfsCounter, 58 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 167.51ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.27ms SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 204.30ms IncrementalHoareTripleChecker+Time [2021-08-30 17:04:50,207 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 25 Invalid, 194 Unknown, 0 Unchecked, 1.27ms Time], IncrementalHoareTripleChecker [9 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 204.30ms Time] [2021-08-30 17:04:50,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2021-08-30 17:04:50,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 281. [2021-08-30 17:04:50,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 216 states have (on average 1.5648148148148149) internal successors, (338), 246 states have internal predecessors, (338), 22 states have call successors, (22), 22 states have call predecessors, (22), 31 states have return successors, (44), 13 states have call predecessors, (44), 21 states have call successors, (44) [2021-08-30 17:04:50,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 404 transitions. [2021-08-30 17:04:50,229 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 404 transitions. Word has length 13 [2021-08-30 17:04:50,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:04:50,230 INFO L470 AbstractCegarLoop]: Abstraction has 281 states and 404 transitions. [2021-08-30 17:04:50,230 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-30 17:04:50,230 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 404 transitions. [2021-08-30 17:04:50,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-08-30 17:04:50,231 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:04:50,232 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:04:50,251 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-30 17:04:50,446 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-30 17:04:50,446 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr5ENSURES_VIOLATIONMEMORY_LEAK === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-30 17:04:50,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:04:50,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1772709125, now seen corresponding path program 1 times [2021-08-30 17:04:50,448 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-30 17:04:50,448 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1213506720] [2021-08-30 17:04:50,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:04:50,448 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-30 17:04:50,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-30 17:04:50,449 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-30 17:04:50,454 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-30 17:04:50,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:04:50,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-30 17:04:50,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:04:50,669 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 17:04:50,669 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:04:50,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 17:04:50,832 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-30 17:04:50,832 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1213506720] [2021-08-30 17:04:50,833 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1213506720] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:04:50,833 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-30 17:04:50,833 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2021-08-30 17:04:50,833 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93210231] [2021-08-30 17:04:50,833 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-30 17:04:50,834 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-30 17:04:50,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-30 17:04:50,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-08-30 17:04:50,834 INFO L87 Difference]: Start difference. First operand 281 states and 404 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-08-30 17:04:51,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:04:51,643 INFO L93 Difference]: Finished difference Result 690 states and 1010 transitions. [2021-08-30 17:04:51,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-30 17:04:51,644 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 18 [2021-08-30 17:04:51,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:04:51,648 INFO L225 Difference]: With dead ends: 690 [2021-08-30 17:04:51,648 INFO L226 Difference]: Without dead ends: 690 [2021-08-30 17:04:51,648 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 110.64ms TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2021-08-30 17:04:51,649 INFO L928 BasicCegarLoop]: 17 mSDtfsCounter, 730 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 586.51ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 733 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.71ms SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 702.67ms IncrementalHoareTripleChecker+Time [2021-08-30 17:04:51,649 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [733 Valid, 20 Invalid, 665 Unknown, 0 Unchecked, 7.71ms Time], IncrementalHoareTripleChecker [104 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 702.67ms Time] [2021-08-30 17:04:51,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2021-08-30 17:04:51,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 587. [2021-08-30 17:04:51,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 472 states have (on average 1.5423728813559323) internal successors, (728), 520 states have internal predecessors, (728), 42 states have call successors, (42), 42 states have call predecessors, (42), 61 states have return successors, (95), 25 states have call predecessors, (95), 41 states have call successors, (95) [2021-08-30 17:04:51,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 865 transitions. [2021-08-30 17:04:51,676 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 865 transitions. Word has length 18 [2021-08-30 17:04:51,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:04:51,676 INFO L470 AbstractCegarLoop]: Abstraction has 587 states and 865 transitions. [2021-08-30 17:04:51,676 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-08-30 17:04:51,676 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 865 transitions. [2021-08-30 17:04:51,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-30 17:04:51,677 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:04:51,677 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:04:51,689 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-30 17:04:51,887 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-30 17:04:51,887 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting popErr0REQUIRES_VIOLATION === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-30 17:04:51,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:04:51,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1092083902, now seen corresponding path program 1 times [2021-08-30 17:04:51,888 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-30 17:04:51,888 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [92293731] [2021-08-30 17:04:51,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:04:51,888 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-30 17:04:51,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-30 17:04:51,889 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-30 17:04:51,890 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-30 17:04:52,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:04:52,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 12 conjunts are in the unsatisfiable core [2021-08-30 17:04:52,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:04:52,121 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 17:04:52,122 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:04:52,271 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 17:04:52,271 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-30 17:04:52,271 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [92293731] [2021-08-30 17:04:52,271 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [92293731] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:04:52,271 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-30 17:04:52,272 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2021-08-30 17:04:52,272 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694114146] [2021-08-30 17:04:52,272 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-30 17:04:52,272 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-30 17:04:52,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-30 17:04:52,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-08-30 17:04:52,273 INFO L87 Difference]: Start difference. First operand 587 states and 865 transitions. Second operand has 10 states, 10 states have (on average 1.7) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-08-30 17:04:53,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:04:53,031 INFO L93 Difference]: Finished difference Result 945 states and 1354 transitions. [2021-08-30 17:04:53,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-30 17:04:53,031 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 20 [2021-08-30 17:04:53,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:04:53,035 INFO L225 Difference]: With dead ends: 945 [2021-08-30 17:04:53,035 INFO L226 Difference]: Without dead ends: 945 [2021-08-30 17:04:53,036 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 148.07ms TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2021-08-30 17:04:53,036 INFO L928 BasicCegarLoop]: 10 mSDtfsCounter, 324 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 512.78ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.99ms SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 620.39ms IncrementalHoareTripleChecker+Time [2021-08-30 17:04:53,036 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [326 Valid, 31 Invalid, 687 Unknown, 0 Unchecked, 5.99ms Time], IncrementalHoareTripleChecker [50 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 620.39ms Time] [2021-08-30 17:04:53,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2021-08-30 17:04:53,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 837. [2021-08-30 17:04:53,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 837 states, 666 states have (on average 1.509009009009009) internal successors, (1005), 738 states have internal predecessors, (1005), 62 states have call successors, (62), 62 states have call predecessors, (62), 97 states have return successors, (127), 37 states have call predecessors, (127), 61 states have call successors, (127) [2021-08-30 17:04:53,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1194 transitions. [2021-08-30 17:04:53,091 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1194 transitions. Word has length 20 [2021-08-30 17:04:53,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:04:53,091 INFO L470 AbstractCegarLoop]: Abstraction has 837 states and 1194 transitions. [2021-08-30 17:04:53,092 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-08-30 17:04:53,092 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1194 transitions. [2021-08-30 17:04:53,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-08-30 17:04:53,096 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:04:53,097 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:04:53,109 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-30 17:04:53,307 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-30 17:04:53,307 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting popErr0REQUIRES_VIOLATION === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-30 17:04:53,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:04:53,308 INFO L82 PathProgramCache]: Analyzing trace with hash -389155418, now seen corresponding path program 2 times [2021-08-30 17:04:53,308 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-30 17:04:53,308 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [402330087] [2021-08-30 17:04:53,308 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-30 17:04:53,308 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-30 17:04:53,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-30 17:04:53,309 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-30 17:04:53,310 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-30 17:04:53,450 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-30 17:04:53,451 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-30 17:04:53,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 9 conjunts are in the unsatisfiable core [2021-08-30 17:04:53,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:04:53,570 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-30 17:04:53,571 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:04:53,691 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-30 17:04:53,691 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-30 17:04:53,691 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [402330087] [2021-08-30 17:04:53,691 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [402330087] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:04:53,691 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-30 17:04:53,691 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2021-08-30 17:04:53,692 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441156120] [2021-08-30 17:04:53,693 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-30 17:04:53,693 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-30 17:04:53,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-30 17:04:53,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-08-30 17:04:53,694 INFO L87 Difference]: Start difference. First operand 837 states and 1194 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2021-08-30 17:04:54,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:04:54,286 INFO L93 Difference]: Finished difference Result 1191 states and 1639 transitions. [2021-08-30 17:04:54,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-30 17:04:54,287 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) Word has length 27 [2021-08-30 17:04:54,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:04:54,293 INFO L225 Difference]: With dead ends: 1191 [2021-08-30 17:04:54,293 INFO L226 Difference]: Without dead ends: 1191 [2021-08-30 17:04:54,293 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 115.71ms TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2021-08-30 17:04:54,294 INFO L928 BasicCegarLoop]: 13 mSDtfsCounter, 147 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 416.12ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.37ms SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 493.04ms IncrementalHoareTripleChecker+Time [2021-08-30 17:04:54,294 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 43 Invalid, 580 Unknown, 0 Unchecked, 4.37ms Time], IncrementalHoareTripleChecker [35 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 493.04ms Time] [2021-08-30 17:04:54,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2021-08-30 17:04:54,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 1147. [2021-08-30 17:04:54,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1147 states, 908 states have (on average 1.4515418502202644) internal successors, (1318), 1016 states have internal predecessors, (1318), 82 states have call successors, (82), 82 states have call predecessors, (82), 145 states have return successors, (195), 49 states have call predecessors, (195), 81 states have call successors, (195) [2021-08-30 17:04:54,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1147 states to 1147 states and 1595 transitions. [2021-08-30 17:04:54,327 INFO L78 Accepts]: Start accepts. Automaton has 1147 states and 1595 transitions. Word has length 27 [2021-08-30 17:04:54,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:04:54,327 INFO L470 AbstractCegarLoop]: Abstraction has 1147 states and 1595 transitions. [2021-08-30 17:04:54,327 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2021-08-30 17:04:54,327 INFO L276 IsEmpty]: Start isEmpty. Operand 1147 states and 1595 transitions. [2021-08-30 17:04:54,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-08-30 17:04:54,328 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:04:54,328 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:04:54,341 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-30 17:04:54,538 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-30 17:04:54,539 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting popErr0REQUIRES_VIOLATION === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-30 17:04:54,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:04:54,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1024254868, now seen corresponding path program 1 times [2021-08-30 17:04:54,539 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-30 17:04:54,539 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1357395927] [2021-08-30 17:04:54,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:04:54,540 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-30 17:04:54,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-30 17:04:54,540 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-30 17:04:54,541 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-30 17:04:54,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:04:54,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 17 conjunts are in the unsatisfiable core [2021-08-30 17:04:54,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:04:54,915 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 17:04:54,915 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:04:55,250 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 17:04:55,250 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-30 17:04:55,250 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1357395927] [2021-08-30 17:04:55,250 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1357395927] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:04:55,250 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-30 17:04:55,250 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2021-08-30 17:04:55,250 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807131123] [2021-08-30 17:04:55,251 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-30 17:04:55,251 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-30 17:04:55,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-30 17:04:55,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-08-30 17:04:55,252 INFO L87 Difference]: Start difference. First operand 1147 states and 1595 transitions. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 4 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2021-08-30 17:04:56,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:04:56,073 INFO L93 Difference]: Finished difference Result 1680 states and 2292 transitions. [2021-08-30 17:04:56,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-30 17:04:56,074 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 4 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 29 [2021-08-30 17:04:56,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:04:56,081 INFO L225 Difference]: With dead ends: 1680 [2021-08-30 17:04:56,081 INFO L226 Difference]: Without dead ends: 1680 [2021-08-30 17:04:56,082 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 244.32ms TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2021-08-30 17:04:56,082 INFO L928 BasicCegarLoop]: 11 mSDtfsCounter, 364 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 551.39ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.45ms SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 648.00ms IncrementalHoareTripleChecker+Time [2021-08-30 17:04:56,082 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [366 Valid, 23 Invalid, 623 Unknown, 0 Unchecked, 6.45ms Time], IncrementalHoareTripleChecker [74 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 648.00ms Time] [2021-08-30 17:04:56,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1680 states. [2021-08-30 17:04:56,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1680 to 1467. [2021-08-30 17:04:56,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1467 states, 1157 states have (on average 1.418323249783924) internal successors, (1641), 1297 states have internal predecessors, (1641), 107 states have call successors, (107), 107 states have call predecessors, (107), 191 states have return successors, (265), 63 states have call predecessors, (265), 106 states have call successors, (265) [2021-08-30 17:04:56,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1467 states to 1467 states and 2013 transitions. [2021-08-30 17:04:56,130 INFO L78 Accepts]: Start accepts. Automaton has 1467 states and 2013 transitions. Word has length 29 [2021-08-30 17:04:56,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:04:56,131 INFO L470 AbstractCegarLoop]: Abstraction has 1467 states and 2013 transitions. [2021-08-30 17:04:56,131 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 4 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2021-08-30 17:04:56,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1467 states and 2013 transitions. [2021-08-30 17:04:56,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-08-30 17:04:56,132 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:04:56,132 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:04:56,142 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-30 17:04:56,342 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-30 17:04:56,342 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr5ENSURES_VIOLATIONMEMORY_LEAK === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-30 17:04:56,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:04:56,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1836404925, now seen corresponding path program 1 times [2021-08-30 17:04:56,343 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-30 17:04:56,343 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1579116833] [2021-08-30 17:04:56,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:04:56,344 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-30 17:04:56,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-30 17:04:56,345 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-30 17:04:56,351 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-30 17:04:56,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:04:56,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 12 conjunts are in the unsatisfiable core [2021-08-30 17:04:56,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:04:56,614 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-30 17:04:56,614 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:04:56,841 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 17:04:56,841 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-30 17:04:56,841 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1579116833] [2021-08-30 17:04:56,841 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1579116833] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:04:56,842 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-30 17:04:56,842 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 13 [2021-08-30 17:04:56,842 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852988384] [2021-08-30 17:04:56,843 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-30 17:04:56,843 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-30 17:04:56,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-30 17:04:56,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-08-30 17:04:56,844 INFO L87 Difference]: Start difference. First operand 1467 states and 2013 transitions. Second operand has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-08-30 17:04:57,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:04:57,842 INFO L93 Difference]: Finished difference Result 1681 states and 2147 transitions. [2021-08-30 17:04:57,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-08-30 17:04:57,843 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 30 [2021-08-30 17:04:57,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:04:57,855 INFO L225 Difference]: With dead ends: 1681 [2021-08-30 17:04:57,855 INFO L226 Difference]: Without dead ends: 1497 [2021-08-30 17:04:57,855 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 337.46ms TimeCoverageRelationStatistics Valid=219, Invalid=711, Unknown=0, NotChecked=0, Total=930 [2021-08-30 17:04:57,856 INFO L928 BasicCegarLoop]: 10 mSDtfsCounter, 486 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 600.28ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.28ms SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 700.97ms IncrementalHoareTripleChecker+Time [2021-08-30 17:04:57,856 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [490 Valid, 15 Invalid, 830 Unknown, 0 Unchecked, 6.28ms Time], IncrementalHoareTripleChecker [88 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 700.97ms Time] [2021-08-30 17:04:57,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1497 states. [2021-08-30 17:04:57,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1497 to 1379. [2021-08-30 17:04:57,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1379 states, 1071 states have (on average 1.38468720821662) internal successors, (1483), 1209 states have internal predecessors, (1483), 107 states have call successors, (107), 107 states have call predecessors, (107), 189 states have return successors, (237), 63 states have call predecessors, (237), 106 states have call successors, (237) [2021-08-30 17:04:57,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1379 states to 1379 states and 1827 transitions. [2021-08-30 17:04:57,890 INFO L78 Accepts]: Start accepts. Automaton has 1379 states and 1827 transitions. Word has length 30 [2021-08-30 17:04:57,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:04:57,890 INFO L470 AbstractCegarLoop]: Abstraction has 1379 states and 1827 transitions. [2021-08-30 17:04:57,891 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-08-30 17:04:57,891 INFO L276 IsEmpty]: Start isEmpty. Operand 1379 states and 1827 transitions. [2021-08-30 17:04:57,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-08-30 17:04:57,893 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:04:57,893 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:04:57,907 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-30 17:04:58,103 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-30 17:04:58,104 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr5ENSURES_VIOLATIONMEMORY_LEAK === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-30 17:04:58,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:04:58,104 INFO L82 PathProgramCache]: Analyzing trace with hash -746793865, now seen corresponding path program 2 times [2021-08-30 17:04:58,105 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-30 17:04:58,105 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1186558432] [2021-08-30 17:04:58,105 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-30 17:04:58,105 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-30 17:04:58,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-30 17:04:58,106 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-30 17:04:58,108 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-30 17:04:58,287 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-30 17:04:58,287 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-30 17:04:58,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 12 conjunts are in the unsatisfiable core [2021-08-30 17:04:58,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:04:58,436 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-08-30 17:04:58,436 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:04:58,677 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-30 17:04:58,678 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-30 17:04:58,678 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1186558432] [2021-08-30 17:04:58,678 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1186558432] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:04:58,678 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-30 17:04:58,678 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2021-08-30 17:04:58,678 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79464219] [2021-08-30 17:04:58,678 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-08-30 17:04:58,678 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-30 17:04:58,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-30 17:04:58,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2021-08-30 17:04:58,679 INFO L87 Difference]: Start difference. First operand 1379 states and 1827 transitions. Second operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 11 states have internal predecessors, (51), 6 states have call successors, (9), 7 states have call predecessors, (9), 7 states have return successors, (8), 5 states have call predecessors, (8), 6 states have call successors, (8) [2021-08-30 17:04:59,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:04:59,949 INFO L93 Difference]: Finished difference Result 2266 states and 3058 transitions. [2021-08-30 17:04:59,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-08-30 17:04:59,950 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 11 states have internal predecessors, (51), 6 states have call successors, (9), 7 states have call predecessors, (9), 7 states have return successors, (8), 5 states have call predecessors, (8), 6 states have call successors, (8) Word has length 39 [2021-08-30 17:04:59,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:04:59,959 INFO L225 Difference]: With dead ends: 2266 [2021-08-30 17:04:59,959 INFO L226 Difference]: Without dead ends: 2170 [2021-08-30 17:04:59,959 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 371.33ms TimeCoverageRelationStatistics Valid=229, Invalid=701, Unknown=0, NotChecked=0, Total=930 [2021-08-30 17:04:59,960 INFO L928 BasicCegarLoop]: 14 mSDtfsCounter, 537 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 1021 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 798.63ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 542 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 1154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.45ms SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 1021 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 943.17ms IncrementalHoareTripleChecker+Time [2021-08-30 17:04:59,960 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [542 Valid, 18 Invalid, 1154 Unknown, 0 Unchecked, 8.45ms Time], IncrementalHoareTripleChecker [133 Valid, 1021 Invalid, 0 Unknown, 0 Unchecked, 943.17ms Time] [2021-08-30 17:04:59,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2170 states. [2021-08-30 17:05:00,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2170 to 1993. [2021-08-30 17:05:00,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1993 states, 1543 states have (on average 1.4121840570317563) internal successors, (2179), 1753 states have internal predecessors, (2179), 165 states have call successors, (165), 153 states have call predecessors, (165), 273 states have return successors, (421), 87 states have call predecessors, (421), 164 states have call successors, (421) [2021-08-30 17:05:00,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1993 states to 1993 states and 2765 transitions. [2021-08-30 17:05:00,019 INFO L78 Accepts]: Start accepts. Automaton has 1993 states and 2765 transitions. Word has length 39 [2021-08-30 17:05:00,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:05:00,019 INFO L470 AbstractCegarLoop]: Abstraction has 1993 states and 2765 transitions. [2021-08-30 17:05:00,020 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 11 states have internal predecessors, (51), 6 states have call successors, (9), 7 states have call predecessors, (9), 7 states have return successors, (8), 5 states have call predecessors, (8), 6 states have call successors, (8) [2021-08-30 17:05:00,020 INFO L276 IsEmpty]: Start isEmpty. Operand 1993 states and 2765 transitions. [2021-08-30 17:05:00,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-08-30 17:05:00,022 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:05:00,022 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:05:00,039 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-30 17:05:00,233 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-30 17:05:00,233 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr5ENSURES_VIOLATIONMEMORY_LEAK === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-30 17:05:00,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:05:00,234 INFO L82 PathProgramCache]: Analyzing trace with hash -268124004, now seen corresponding path program 1 times [2021-08-30 17:05:00,234 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-30 17:05:00,235 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [242570479] [2021-08-30 17:05:00,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:05:00,235 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-30 17:05:00,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-30 17:05:00,236 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-30 17:05:00,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-08-30 17:05:00,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:05:00,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 16 conjunts are in the unsatisfiable core [2021-08-30 17:05:00,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:05:00,537 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-08-30 17:05:00,537 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:05:00,853 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 17:05:00,853 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-30 17:05:00,853 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [242570479] [2021-08-30 17:05:00,853 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [242570479] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:05:00,854 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-30 17:05:00,854 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 16 [2021-08-30 17:05:00,854 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865048695] [2021-08-30 17:05:00,854 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-08-30 17:05:00,854 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-30 17:05:00,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-08-30 17:05:00,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2021-08-30 17:05:00,855 INFO L87 Difference]: Start difference. First operand 1993 states and 2765 transitions. Second operand has 16 states, 16 states have (on average 2.5625) internal successors, (41), 11 states have internal predecessors, (41), 4 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-08-30 17:05:02,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:05:02,260 INFO L93 Difference]: Finished difference Result 2261 states and 2971 transitions. [2021-08-30 17:05:02,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-08-30 17:05:02,261 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.5625) internal successors, (41), 11 states have internal predecessors, (41), 4 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 39 [2021-08-30 17:05:02,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:05:02,270 INFO L225 Difference]: With dead ends: 2261 [2021-08-30 17:05:02,270 INFO L226 Difference]: Without dead ends: 2089 [2021-08-30 17:05:02,271 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 486.28ms TimeCoverageRelationStatistics Valid=308, Invalid=1098, Unknown=0, NotChecked=0, Total=1406 [2021-08-30 17:05:02,271 INFO L928 BasicCegarLoop]: 13 mSDtfsCounter, 654 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 1174 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 837.30ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 654 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 1315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.06ms SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 1174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 987.37ms IncrementalHoareTripleChecker+Time [2021-08-30 17:05:02,272 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [654 Valid, 18 Invalid, 1315 Unknown, 0 Unchecked, 7.06ms Time], IncrementalHoareTripleChecker [141 Valid, 1174 Invalid, 0 Unknown, 0 Unchecked, 987.37ms Time] [2021-08-30 17:05:02,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2089 states. [2021-08-30 17:05:02,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2089 to 1917. [2021-08-30 17:05:02,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1917 states, 1469 states have (on average 1.3921034717494893) internal successors, (2045), 1677 states have internal predecessors, (2045), 165 states have call successors, (165), 153 states have call predecessors, (165), 271 states have return successors, (393), 87 states have call predecessors, (393), 164 states have call successors, (393) [2021-08-30 17:05:02,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1917 states to 1917 states and 2603 transitions. [2021-08-30 17:05:02,329 INFO L78 Accepts]: Start accepts. Automaton has 1917 states and 2603 transitions. Word has length 39 [2021-08-30 17:05:02,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:05:02,329 INFO L470 AbstractCegarLoop]: Abstraction has 1917 states and 2603 transitions. [2021-08-30 17:05:02,330 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.5625) internal successors, (41), 11 states have internal predecessors, (41), 4 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-08-30 17:05:02,330 INFO L276 IsEmpty]: Start isEmpty. Operand 1917 states and 2603 transitions. [2021-08-30 17:05:02,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-08-30 17:05:02,330 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:05:02,331 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:05:02,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-08-30 17:05:02,542 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-30 17:05:02,542 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr5ENSURES_VIOLATIONMEMORY_LEAK === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-30 17:05:02,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:05:02,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1040706548, now seen corresponding path program 1 times [2021-08-30 17:05:02,543 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-30 17:05:02,543 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [603002297] [2021-08-30 17:05:02,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:05:02,543 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-30 17:05:02,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-30 17:05:02,544 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-30 17:05:02,545 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-30 17:05:02,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:05:02,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 22 conjunts are in the unsatisfiable core [2021-08-30 17:05:02,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:05:03,118 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 4 proven. 30 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-08-30 17:05:03,119 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:05:04,242 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 4 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 17:05:04,242 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-30 17:05:04,242 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [603002297] [2021-08-30 17:05:04,242 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [603002297] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:05:04,242 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-30 17:05:04,242 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17] total 26 [2021-08-30 17:05:04,243 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943370839] [2021-08-30 17:05:04,243 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-08-30 17:05:04,243 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-30 17:05:04,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-08-30 17:05:04,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=547, Unknown=0, NotChecked=0, Total=650 [2021-08-30 17:05:04,244 INFO L87 Difference]: Start difference. First operand 1917 states and 2603 transitions. Second operand has 26 states, 26 states have (on average 2.230769230769231) internal successors, (58), 20 states have internal predecessors, (58), 9 states have call successors, (11), 8 states have call predecessors, (11), 7 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2021-08-30 17:05:08,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:05:08,019 INFO L93 Difference]: Finished difference Result 3752 states and 4910 transitions. [2021-08-30 17:05:08,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2021-08-30 17:05:08,027 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.230769230769231) internal successors, (58), 20 states have internal predecessors, (58), 9 states have call successors, (11), 8 states have call predecessors, (11), 7 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) Word has length 45 [2021-08-30 17:05:08,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:05:08,040 INFO L225 Difference]: With dead ends: 3752 [2021-08-30 17:05:08,040 INFO L226 Difference]: Without dead ends: 3716 [2021-08-30 17:05:08,043 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1181 ImplicationChecksByTransitivity, 2052.10ms TimeCoverageRelationStatistics Valid=977, Invalid=4279, Unknown=0, NotChecked=0, Total=5256 [2021-08-30 17:05:08,043 INFO L928 BasicCegarLoop]: 27 mSDtfsCounter, 2060 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 2471 mSolverCounterSat, 612 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1763.08ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2065 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 3083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 13.85ms SdHoareTripleChecker+Time, 612 IncrementalHoareTripleChecker+Valid, 2471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2084.24ms IncrementalHoareTripleChecker+Time [2021-08-30 17:05:08,044 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [2065 Valid, 34 Invalid, 3083 Unknown, 0 Unchecked, 13.85ms Time], IncrementalHoareTripleChecker [612 Valid, 2471 Invalid, 0 Unknown, 0 Unchecked, 2084.24ms Time] [2021-08-30 17:05:08,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3716 states. [2021-08-30 17:05:08,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3716 to 3017. [2021-08-30 17:05:08,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3017 states, 2325 states have (on average 1.3372043010752688) internal successors, (3109), 2625 states have internal predecessors, (3109), 257 states have call successors, (257), 257 states have call predecessors, (257), 423 states have return successors, (665), 135 states have call predecessors, (665), 256 states have call successors, (665) [2021-08-30 17:05:08,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3017 states to 3017 states and 4031 transitions. [2021-08-30 17:05:08,131 INFO L78 Accepts]: Start accepts. Automaton has 3017 states and 4031 transitions. Word has length 45 [2021-08-30 17:05:08,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:05:08,132 INFO L470 AbstractCegarLoop]: Abstraction has 3017 states and 4031 transitions. [2021-08-30 17:05:08,132 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.230769230769231) internal successors, (58), 20 states have internal predecessors, (58), 9 states have call successors, (11), 8 states have call predecessors, (11), 7 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2021-08-30 17:05:08,133 INFO L276 IsEmpty]: Start isEmpty. Operand 3017 states and 4031 transitions. [2021-08-30 17:05:08,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-08-30 17:05:08,134 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:05:08,134 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:05:08,151 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-30 17:05:08,351 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-30 17:05:08,352 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr5ENSURES_VIOLATIONMEMORY_LEAK === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-30 17:05:08,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:05:08,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1515964261, now seen corresponding path program 1 times [2021-08-30 17:05:08,355 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-30 17:05:08,356 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1941441378] [2021-08-30 17:05:08,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:05:08,356 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-30 17:05:08,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-30 17:05:08,357 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-30 17:05:08,373 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-30 17:05:08,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:05:08,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 20 conjunts are in the unsatisfiable core [2021-08-30 17:05:08,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:05:08,685 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 4 proven. 30 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-08-30 17:05:08,685 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:05:09,130 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 4 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 17:05:09,130 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-30 17:05:09,130 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1941441378] [2021-08-30 17:05:09,131 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1941441378] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:05:09,131 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-30 17:05:09,131 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16] total 19 [2021-08-30 17:05:09,131 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369784880] [2021-08-30 17:05:09,131 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-08-30 17:05:09,131 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-30 17:05:09,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-08-30 17:05:09,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2021-08-30 17:05:09,132 INFO L87 Difference]: Start difference. First operand 3017 states and 4031 transitions. Second operand has 19 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 13 states have internal predecessors, (51), 5 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2021-08-30 17:05:10,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:05:10,662 INFO L93 Difference]: Finished difference Result 4090 states and 5262 transitions. [2021-08-30 17:05:10,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-08-30 17:05:10,663 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 13 states have internal predecessors, (51), 5 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 48 [2021-08-30 17:05:10,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:05:10,679 INFO L225 Difference]: With dead ends: 4090 [2021-08-30 17:05:10,679 INFO L226 Difference]: Without dead ends: 3950 [2021-08-30 17:05:10,680 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 635.29ms TimeCoverageRelationStatistics Valid=398, Invalid=1494, Unknown=0, NotChecked=0, Total=1892 [2021-08-30 17:05:10,681 INFO L928 BasicCegarLoop]: 15 mSDtfsCounter, 1158 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 1506 mSolverCounterSat, 248 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 848.30ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1158 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 1754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.06ms SdHoareTripleChecker+Time, 248 IncrementalHoareTripleChecker+Valid, 1506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1014.27ms IncrementalHoareTripleChecker+Time [2021-08-30 17:05:10,681 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [1158 Valid, 20 Invalid, 1754 Unknown, 0 Unchecked, 6.06ms Time], IncrementalHoareTripleChecker [248 Valid, 1506 Invalid, 0 Unknown, 0 Unchecked, 1014.27ms Time] [2021-08-30 17:05:10,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3950 states. [2021-08-30 17:05:10,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3950 to 3716. [2021-08-30 17:05:10,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3716 states, 2853 states have (on average 1.3168594461969856) internal successors, (3757), 3219 states have internal predecessors, (3757), 326 states have call successors, (326), 326 states have call predecessors, (326), 525 states have return successors, (779), 171 states have call predecessors, (779), 325 states have call successors, (779) [2021-08-30 17:05:10,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3716 states to 3716 states and 4862 transitions. [2021-08-30 17:05:10,774 INFO L78 Accepts]: Start accepts. Automaton has 3716 states and 4862 transitions. Word has length 48 [2021-08-30 17:05:10,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:05:10,774 INFO L470 AbstractCegarLoop]: Abstraction has 3716 states and 4862 transitions. [2021-08-30 17:05:10,774 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 13 states have internal predecessors, (51), 5 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2021-08-30 17:05:10,775 INFO L276 IsEmpty]: Start isEmpty. Operand 3716 states and 4862 transitions. [2021-08-30 17:05:10,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-08-30 17:05:10,775 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:05:10,776 INFO L513 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:05:10,789 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-30 17:05:10,985 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-30 17:05:10,985 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr5ENSURES_VIOLATIONMEMORY_LEAK === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-30 17:05:10,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:05:10,986 INFO L82 PathProgramCache]: Analyzing trace with hash 574627678, now seen corresponding path program 1 times [2021-08-30 17:05:10,986 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-30 17:05:10,986 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [802179429] [2021-08-30 17:05:10,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:05:10,986 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-30 17:05:10,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-30 17:05:10,987 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-30 17:05:11,030 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-30 17:05:11,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:05:11,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 24 conjunts are in the unsatisfiable core [2021-08-30 17:05:11,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:05:11,436 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 5 proven. 48 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-08-30 17:05:11,437 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:05:11,951 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 5 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 17:05:11,951 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-30 17:05:11,951 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [802179429] [2021-08-30 17:05:11,951 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [802179429] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:05:11,951 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-30 17:05:11,951 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 19] total 22 [2021-08-30 17:05:11,951 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128909677] [2021-08-30 17:05:11,952 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-08-30 17:05:11,952 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-30 17:05:11,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-08-30 17:05:11,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2021-08-30 17:05:11,953 INFO L87 Difference]: Start difference. First operand 3716 states and 4862 transitions. Second operand has 22 states, 22 states have (on average 2.909090909090909) internal successors, (64), 15 states have internal predecessors, (64), 6 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2021-08-30 17:05:14,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:05:14,100 INFO L93 Difference]: Finished difference Result 4249 states and 5467 transitions. [2021-08-30 17:05:14,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-08-30 17:05:14,101 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.909090909090909) internal successors, (64), 15 states have internal predecessors, (64), 6 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) Word has length 59 [2021-08-30 17:05:14,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:05:14,136 INFO L225 Difference]: With dead ends: 4249 [2021-08-30 17:05:14,136 INFO L226 Difference]: Without dead ends: 4177 [2021-08-30 17:05:14,137 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 430 ImplicationChecksByTransitivity, 838.82ms TimeCoverageRelationStatistics Valid=493, Invalid=1957, Unknown=0, NotChecked=0, Total=2450 [2021-08-30 17:05:14,138 INFO L928 BasicCegarLoop]: 17 mSDtfsCounter, 1457 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 2458 mSolverCounterSat, 346 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1220.71ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1457 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 2804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.09ms SdHoareTripleChecker+Time, 346 IncrementalHoareTripleChecker+Valid, 2458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1451.96ms IncrementalHoareTripleChecker+Time [2021-08-30 17:05:14,138 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [1457 Valid, 25 Invalid, 2804 Unknown, 0 Unchecked, 9.09ms Time], IncrementalHoareTripleChecker [346 Valid, 2458 Invalid, 0 Unknown, 0 Unchecked, 1451.96ms Time] [2021-08-30 17:05:14,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4177 states. [2021-08-30 17:05:14,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4177 to 4017. [2021-08-30 17:05:14,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4017 states, 3083 states have (on average 1.3139798897178074) internal successors, (4051), 3485 states have internal predecessors, (4051), 349 states have call successors, (349), 349 states have call predecessors, (349), 573 states have return successors, (833), 183 states have call predecessors, (833), 348 states have call successors, (833) [2021-08-30 17:05:14,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4017 states to 4017 states and 5233 transitions. [2021-08-30 17:05:14,229 INFO L78 Accepts]: Start accepts. Automaton has 4017 states and 5233 transitions. Word has length 59 [2021-08-30 17:05:14,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:05:14,229 INFO L470 AbstractCegarLoop]: Abstraction has 4017 states and 5233 transitions. [2021-08-30 17:05:14,229 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.909090909090909) internal successors, (64), 15 states have internal predecessors, (64), 6 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2021-08-30 17:05:14,230 INFO L276 IsEmpty]: Start isEmpty. Operand 4017 states and 5233 transitions. [2021-08-30 17:05:14,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-08-30 17:05:14,231 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:05:14,231 INFO L513 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:05:14,245 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-30 17:05:14,442 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-30 17:05:14,443 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr5ENSURES_VIOLATIONMEMORY_LEAK === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-30 17:05:14,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:05:14,443 INFO L82 PathProgramCache]: Analyzing trace with hash 517554629, now seen corresponding path program 2 times [2021-08-30 17:05:14,443 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-30 17:05:14,443 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [462027191] [2021-08-30 17:05:14,444 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-30 17:05:14,444 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-30 17:05:14,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-30 17:05:14,444 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-30 17:05:14,447 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-30 17:05:14,640 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-30 17:05:14,640 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-30 17:05:14,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 27 conjunts are in the unsatisfiable core [2021-08-30 17:05:14,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:05:15,215 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 49 proven. 49 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-08-30 17:05:15,215 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:05:16,859 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 20 proven. 110 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-30 17:05:16,860 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-30 17:05:16,860 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [462027191] [2021-08-30 17:05:16,860 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [462027191] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:05:16,860 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-30 17:05:16,860 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 21] total 32 [2021-08-30 17:05:16,860 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970587419] [2021-08-30 17:05:16,861 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-08-30 17:05:16,861 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-30 17:05:16,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-08-30 17:05:16,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=849, Unknown=0, NotChecked=0, Total=992 [2021-08-30 17:05:16,862 INFO L87 Difference]: Start difference. First operand 4017 states and 5233 transitions. Second operand has 32 states, 32 states have (on average 2.90625) internal successors, (93), 26 states have internal predecessors, (93), 12 states have call successors, (15), 10 states have call predecessors, (15), 10 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) [2021-08-30 17:05:22,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:05:22,678 INFO L93 Difference]: Finished difference Result 7214 states and 9448 transitions. [2021-08-30 17:05:22,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2021-08-30 17:05:22,679 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.90625) internal successors, (93), 26 states have internal predecessors, (93), 12 states have call successors, (15), 10 states have call predecessors, (15), 10 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) Word has length 70 [2021-08-30 17:05:22,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:05:22,715 INFO L225 Difference]: With dead ends: 7214 [2021-08-30 17:05:22,715 INFO L226 Difference]: Without dead ends: 7154 [2021-08-30 17:05:22,717 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1952 ImplicationChecksByTransitivity, 3429.41ms TimeCoverageRelationStatistics Valid=1482, Invalid=6890, Unknown=0, NotChecked=0, Total=8372 [2021-08-30 17:05:22,718 INFO L928 BasicCegarLoop]: 31 mSDtfsCounter, 3218 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 3665 mSolverCounterSat, 1035 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2423.25ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3224 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 4700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 17.58ms SdHoareTripleChecker+Time, 1035 IncrementalHoareTripleChecker+Valid, 3665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2854.35ms IncrementalHoareTripleChecker+Time [2021-08-30 17:05:22,718 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [3224 Valid, 41 Invalid, 4700 Unknown, 0 Unchecked, 17.58ms Time], IncrementalHoareTripleChecker [1035 Valid, 3665 Invalid, 0 Unknown, 0 Unchecked, 2854.35ms Time] [2021-08-30 17:05:22,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7154 states. [2021-08-30 17:05:22,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7154 to 5071. [2021-08-30 17:05:22,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5071 states, 3907 states have (on average 1.3137957512157665) internal successors, (5133), 4429 states have internal predecessors, (5133), 421 states have call successors, (421), 421 states have call predecessors, (421), 731 states have return successors, (1057), 221 states have call predecessors, (1057), 420 states have call successors, (1057) [2021-08-30 17:05:22,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5071 states to 5071 states and 6611 transitions. [2021-08-30 17:05:22,893 INFO L78 Accepts]: Start accepts. Automaton has 5071 states and 6611 transitions. Word has length 70 [2021-08-30 17:05:22,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:05:22,894 INFO L470 AbstractCegarLoop]: Abstraction has 5071 states and 6611 transitions. [2021-08-30 17:05:22,895 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.90625) internal successors, (93), 26 states have internal predecessors, (93), 12 states have call successors, (15), 10 states have call predecessors, (15), 10 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) [2021-08-30 17:05:22,895 INFO L276 IsEmpty]: Start isEmpty. Operand 5071 states and 6611 transitions. [2021-08-30 17:05:22,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-08-30 17:05:22,896 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:05:22,896 INFO L513 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:05:22,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2021-08-30 17:05:23,108 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-30 17:05:23,109 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr5ENSURES_VIOLATIONMEMORY_LEAK === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-30 17:05:23,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:05:23,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1608789574, now seen corresponding path program 1 times [2021-08-30 17:05:23,109 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-30 17:05:23,110 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [696191943] [2021-08-30 17:05:23,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:05:23,110 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-30 17:05:23,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-30 17:05:23,111 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-30 17:05:23,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-08-30 17:05:23,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:05:23,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 13 conjunts are in the unsatisfiable core [2021-08-30 17:05:23,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:05:23,434 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 32 proven. 52 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-08-30 17:05:23,434 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:05:23,785 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 26 proven. 58 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-08-30 17:05:23,786 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-30 17:05:23,786 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [696191943] [2021-08-30 17:05:23,786 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [696191943] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:05:23,786 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-30 17:05:23,786 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-08-30 17:05:23,786 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381987575] [2021-08-30 17:05:23,786 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-30 17:05:23,787 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-30 17:05:23,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-30 17:05:23,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-08-30 17:05:23,787 INFO L87 Difference]: Start difference. First operand 5071 states and 6611 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 3 states have call successors, (7), 5 states have call predecessors, (7), 8 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-08-30 17:05:24,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:05:24,336 INFO L93 Difference]: Finished difference Result 9835 states and 12944 transitions. [2021-08-30 17:05:24,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-30 17:05:24,337 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 3 states have call successors, (7), 5 states have call predecessors, (7), 8 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 71 [2021-08-30 17:05:24,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:05:24,367 INFO L225 Difference]: With dead ends: 9835 [2021-08-30 17:05:24,368 INFO L226 Difference]: Without dead ends: 9835 [2021-08-30 17:05:24,368 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 95.43ms TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2021-08-30 17:05:24,369 INFO L928 BasicCegarLoop]: 9 mSDtfsCounter, 410 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 381.06ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.58ms SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 452.13ms IncrementalHoareTripleChecker+Time [2021-08-30 17:05:24,369 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [412 Valid, 18 Invalid, 605 Unknown, 0 Unchecked, 2.58ms Time], IncrementalHoareTripleChecker [86 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 452.13ms Time] [2021-08-30 17:05:24,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9835 states. [2021-08-30 17:05:24,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9835 to 9811. [2021-08-30 17:05:24,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9811 states, 7495 states have (on average 1.313809206137425) internal successors, (9847), 8623 states have internal predecessors, (9847), 778 states have call successors, (778), 778 states have call predecessors, (778), 1526 states have return successors, (2299), 410 states have call predecessors, (2299), 777 states have call successors, (2299) [2021-08-30 17:05:24,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9811 states to 9811 states and 12924 transitions. [2021-08-30 17:05:24,628 INFO L78 Accepts]: Start accepts. Automaton has 9811 states and 12924 transitions. Word has length 71 [2021-08-30 17:05:24,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:05:24,628 INFO L470 AbstractCegarLoop]: Abstraction has 9811 states and 12924 transitions. [2021-08-30 17:05:24,628 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 3 states have call successors, (7), 5 states have call predecessors, (7), 8 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-08-30 17:05:24,629 INFO L276 IsEmpty]: Start isEmpty. Operand 9811 states and 12924 transitions. [2021-08-30 17:05:24,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-08-30 17:05:24,630 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:05:24,631 INFO L513 BasicCegarLoop]: trace histogram [8, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:05:24,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2021-08-30 17:05:24,842 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-30 17:05:24,843 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting popErr0REQUIRES_VIOLATION === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-30 17:05:24,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:05:24,843 INFO L82 PathProgramCache]: Analyzing trace with hash -511357765, now seen corresponding path program 1 times [2021-08-30 17:05:24,844 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-30 17:05:24,844 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1393870415] [2021-08-30 17:05:24,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:05:24,844 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-30 17:05:24,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-30 17:05:24,845 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-30 17:05:24,846 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-30 17:05:25,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:05:25,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 26 conjunts are in the unsatisfiable core [2021-08-30 17:05:25,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:05:25,064 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-30 17:05:25,568 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 32 proven. 47 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-08-30 17:05:25,569 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:05:26,192 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 29 proven. 50 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-08-30 17:05:26,192 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-30 17:05:26,192 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1393870415] [2021-08-30 17:05:26,192 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1393870415] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:05:26,192 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-30 17:05:26,192 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2021-08-30 17:05:26,192 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602303786] [2021-08-30 17:05:26,193 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-30 17:05:26,193 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-30 17:05:26,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-30 17:05:26,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2021-08-30 17:05:26,194 INFO L87 Difference]: Start difference. First operand 9811 states and 12924 transitions. Second operand has 15 states, 14 states have (on average 4.571428571428571) internal successors, (64), 15 states have internal predecessors, (64), 4 states have call successors, (10), 8 states have call predecessors, (10), 10 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2021-08-30 17:05:27,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:05:27,664 INFO L93 Difference]: Finished difference Result 17086 states and 22591 transitions. [2021-08-30 17:05:27,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-08-30 17:05:27,664 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.571428571428571) internal successors, (64), 15 states have internal predecessors, (64), 4 states have call successors, (10), 8 states have call predecessors, (10), 10 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 79 [2021-08-30 17:05:27,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:05:27,717 INFO L225 Difference]: With dead ends: 17086 [2021-08-30 17:05:27,717 INFO L226 Difference]: Without dead ends: 17086 [2021-08-30 17:05:27,718 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 148 SyntacticMatches, 9 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 676.64ms TimeCoverageRelationStatistics Valid=326, Invalid=864, Unknown=0, NotChecked=0, Total=1190 [2021-08-30 17:05:27,718 INFO L928 BasicCegarLoop]: 15 mSDtfsCounter, 757 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 821.75ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 760 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 1336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.26ms SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 401 IncrementalHoareTripleChecker+Unchecked, 980.62ms IncrementalHoareTripleChecker+Time [2021-08-30 17:05:27,718 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [760 Valid, 27 Invalid, 1336 Unknown, 0 Unchecked, 6.26ms Time], IncrementalHoareTripleChecker [139 Valid, 796 Invalid, 0 Unknown, 401 Unchecked, 980.62ms Time] [2021-08-30 17:05:27,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17086 states. [2021-08-30 17:05:28,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17086 to 14716. [2021-08-30 17:05:28,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14716 states, 11313 states have (on average 1.324935914434721) internal successors, (14989), 13024 states have internal predecessors, (14989), 1114 states have call successors, (1114), 1114 states have call predecessors, (1114), 2278 states have return successors, (3481), 578 states have call predecessors, (3481), 1113 states have call successors, (3481) [2021-08-30 17:05:28,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14716 states to 14716 states and 19584 transitions. [2021-08-30 17:05:28,093 INFO L78 Accepts]: Start accepts. Automaton has 14716 states and 19584 transitions. Word has length 79 [2021-08-30 17:05:28,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:05:28,093 INFO L470 AbstractCegarLoop]: Abstraction has 14716 states and 19584 transitions. [2021-08-30 17:05:28,094 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.571428571428571) internal successors, (64), 15 states have internal predecessors, (64), 4 states have call successors, (10), 8 states have call predecessors, (10), 10 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2021-08-30 17:05:28,094 INFO L276 IsEmpty]: Start isEmpty. Operand 14716 states and 19584 transitions. [2021-08-30 17:05:28,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-08-30 17:05:28,100 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:05:28,100 INFO L513 BasicCegarLoop]: trace histogram [8, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:05:28,114 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-30 17:05:28,314 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-30 17:05:28,314 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting popErr1REQUIRES_VIOLATION === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-30 17:05:28,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:05:28,315 INFO L82 PathProgramCache]: Analyzing trace with hash -511357764, now seen corresponding path program 1 times [2021-08-30 17:05:28,315 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-30 17:05:28,315 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2094142092] [2021-08-30 17:05:28,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:05:28,316 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-30 17:05:28,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-30 17:05:28,317 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-30 17:05:28,321 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-30 17:05:28,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:05:28,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 43 conjunts are in the unsatisfiable core [2021-08-30 17:05:28,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:05:28,551 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-30 17:05:29,174 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 32 proven. 47 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-08-30 17:05:29,174 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:05:31,136 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 29 proven. 50 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-08-30 17:05:31,136 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-30 17:05:31,136 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2094142092] [2021-08-30 17:05:31,137 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2094142092] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:05:31,137 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-30 17:05:31,137 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2021-08-30 17:05:31,137 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654243890] [2021-08-30 17:05:31,137 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-08-30 17:05:31,137 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-30 17:05:31,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-08-30 17:05:31,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2021-08-30 17:05:31,138 INFO L87 Difference]: Start difference. First operand 14716 states and 19584 transitions. Second operand has 18 states, 17 states have (on average 4.647058823529412) internal successors, (79), 18 states have internal predecessors, (79), 7 states have call successors, (11), 9 states have call predecessors, (11), 11 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) [2021-08-30 17:05:38,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:05:38,040 INFO L93 Difference]: Finished difference Result 23185 states and 31397 transitions. [2021-08-30 17:05:38,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-08-30 17:05:38,043 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 4.647058823529412) internal successors, (79), 18 states have internal predecessors, (79), 7 states have call successors, (11), 9 states have call predecessors, (11), 11 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) Word has length 79 [2021-08-30 17:05:38,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:05:38,112 INFO L225 Difference]: With dead ends: 23185 [2021-08-30 17:05:38,112 INFO L226 Difference]: Without dead ends: 23185 [2021-08-30 17:05:38,113 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 154 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 3536.93ms TimeCoverageRelationStatistics Valid=547, Invalid=1433, Unknown=0, NotChecked=0, Total=1980 [2021-08-30 17:05:38,114 INFO L928 BasicCegarLoop]: 13 mSDtfsCounter, 870 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 1164 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3421.27ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 873 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 2259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 13.97ms SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 1164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 875 IncrementalHoareTripleChecker+Unchecked, 3852.75ms IncrementalHoareTripleChecker+Time [2021-08-30 17:05:38,114 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [873 Valid, 30 Invalid, 2259 Unknown, 0 Unchecked, 13.97ms Time], IncrementalHoareTripleChecker [220 Valid, 1164 Invalid, 0 Unknown, 875 Unchecked, 3852.75ms Time] [2021-08-30 17:05:38,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23185 states. [2021-08-30 17:05:38,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23185 to 20030. [2021-08-30 17:05:38,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20030 states, 15577 states have (on average 1.3455094048918277) internal successors, (20959), 17838 states have internal predecessors, (20959), 1446 states have call successors, (1446), 1446 states have call predecessors, (1446), 2996 states have return successors, (4913), 746 states have call predecessors, (4913), 1445 states have call successors, (4913) [2021-08-30 17:05:38,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20030 states to 20030 states and 27318 transitions. [2021-08-30 17:05:38,574 INFO L78 Accepts]: Start accepts. Automaton has 20030 states and 27318 transitions. Word has length 79 [2021-08-30 17:05:38,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:05:38,575 INFO L470 AbstractCegarLoop]: Abstraction has 20030 states and 27318 transitions. [2021-08-30 17:05:38,575 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 4.647058823529412) internal successors, (79), 18 states have internal predecessors, (79), 7 states have call successors, (11), 9 states have call predecessors, (11), 11 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) [2021-08-30 17:05:38,575 INFO L276 IsEmpty]: Start isEmpty. Operand 20030 states and 27318 transitions. [2021-08-30 17:05:38,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-08-30 17:05:38,579 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:05:38,579 INFO L513 BasicCegarLoop]: trace histogram [9, 6, 6, 6, 6, 6, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:05:38,600 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-30 17:05:38,792 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-30 17:05:38,792 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr5ENSURES_VIOLATIONMEMORY_LEAK === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-30 17:05:38,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:05:38,794 INFO L82 PathProgramCache]: Analyzing trace with hash 175036294, now seen corresponding path program 1 times [2021-08-30 17:05:38,795 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-30 17:05:38,795 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [987222503] [2021-08-30 17:05:38,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:05:38,795 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-30 17:05:38,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-30 17:05:38,796 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-30 17:05:38,798 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-30 17:05:39,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:05:39,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 16 conjunts are in the unsatisfiable core [2021-08-30 17:05:39,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:05:39,334 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 59 proven. 36 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2021-08-30 17:05:39,335 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:05:39,749 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 29 proven. 42 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2021-08-30 17:05:39,749 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-30 17:05:39,750 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [987222503] [2021-08-30 17:05:39,750 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [987222503] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:05:39,750 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-30 17:05:39,750 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 16 [2021-08-30 17:05:39,750 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573895462] [2021-08-30 17:05:39,750 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-08-30 17:05:39,751 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-30 17:05:39,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-08-30 17:05:39,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2021-08-30 17:05:39,751 INFO L87 Difference]: Start difference. First operand 20030 states and 27318 transitions. Second operand has 16 states, 16 states have (on average 5.0625) internal successors, (81), 12 states have internal predecessors, (81), 5 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2021-08-30 17:05:41,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:05:41,209 INFO L93 Difference]: Finished difference Result 26523 states and 35493 transitions. [2021-08-30 17:05:41,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-08-30 17:05:41,211 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.0625) internal successors, (81), 12 states have internal predecessors, (81), 5 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) Word has length 98 [2021-08-30 17:05:41,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:05:41,289 INFO L225 Difference]: With dead ends: 26523 [2021-08-30 17:05:41,290 INFO L226 Difference]: Without dead ends: 25305 [2021-08-30 17:05:41,290 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 497.44ms TimeCoverageRelationStatistics Valid=317, Invalid=1165, Unknown=0, NotChecked=0, Total=1482 [2021-08-30 17:05:41,291 INFO L928 BasicCegarLoop]: 14 mSDtfsCounter, 798 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 1226 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 839.73ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 798 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 1384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.45ms SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 1226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 988.24ms IncrementalHoareTripleChecker+Time [2021-08-30 17:05:41,291 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [798 Valid, 21 Invalid, 1384 Unknown, 0 Unchecked, 5.45ms Time], IncrementalHoareTripleChecker [158 Valid, 1226 Invalid, 0 Unknown, 0 Unchecked, 988.24ms Time] [2021-08-30 17:05:41,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25305 states. [2021-08-30 17:05:41,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25305 to 23523. [2021-08-30 17:05:41,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23523 states, 18208 states have (on average 1.3502855887521967) internal successors, (24586), 20953 states have internal predecessors, (24586), 1698 states have call successors, (1698), 1698 states have call predecessors, (1698), 3606 states have return successors, (5737), 872 states have call predecessors, (5737), 1697 states have call successors, (5737) [2021-08-30 17:05:41,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23523 states to 23523 states and 32021 transitions. [2021-08-30 17:05:41,799 INFO L78 Accepts]: Start accepts. Automaton has 23523 states and 32021 transitions. Word has length 98 [2021-08-30 17:05:41,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:05:41,799 INFO L470 AbstractCegarLoop]: Abstraction has 23523 states and 32021 transitions. [2021-08-30 17:05:41,799 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.0625) internal successors, (81), 12 states have internal predecessors, (81), 5 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2021-08-30 17:05:41,799 INFO L276 IsEmpty]: Start isEmpty. Operand 23523 states and 32021 transitions. [2021-08-30 17:05:41,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-08-30 17:05:41,803 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:05:41,804 INFO L513 BasicCegarLoop]: trace histogram [10, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:05:41,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Ended with exit code 0 [2021-08-30 17:05:42,015 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-30 17:05:42,016 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr5ENSURES_VIOLATIONMEMORY_LEAK === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-30 17:05:42,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:05:42,016 INFO L82 PathProgramCache]: Analyzing trace with hash -159277390, now seen corresponding path program 2 times [2021-08-30 17:05:42,017 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-30 17:05:42,017 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1794063623] [2021-08-30 17:05:42,017 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-30 17:05:42,017 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-30 17:05:42,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-30 17:05:42,018 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-30 17:05:42,018 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-30 17:05:42,317 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-30 17:05:42,317 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-30 17:05:42,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 17 conjunts are in the unsatisfiable core [2021-08-30 17:05:42,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:05:42,692 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 92 proven. 37 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2021-08-30 17:05:42,692 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:05:43,372 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 48 proven. 57 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2021-08-30 17:05:43,372 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-30 17:05:43,372 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1794063623] [2021-08-30 17:05:43,372 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1794063623] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:05:43,372 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-30 17:05:43,372 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 20 [2021-08-30 17:05:43,373 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747954174] [2021-08-30 17:05:43,373 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-08-30 17:05:43,373 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-30 17:05:43,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-08-30 17:05:43,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2021-08-30 17:05:43,374 INFO L87 Difference]: Start difference. First operand 23523 states and 32021 transitions. Second operand has 20 states, 20 states have (on average 5.15) internal successors, (103), 16 states have internal predecessors, (103), 8 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (14), 7 states have call predecessors, (14), 8 states have call successors, (14) [2021-08-30 17:05:46,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:05:46,110 INFO L93 Difference]: Finished difference Result 67532 states and 95378 transitions. [2021-08-30 17:05:46,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-08-30 17:05:46,111 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.15) internal successors, (103), 16 states have internal predecessors, (103), 8 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (14), 7 states have call predecessors, (14), 8 states have call successors, (14) Word has length 107 [2021-08-30 17:05:46,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:05:46,337 INFO L225 Difference]: With dead ends: 67532 [2021-08-30 17:05:46,337 INFO L226 Difference]: Without dead ends: 65852 [2021-08-30 17:05:46,338 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 1144.69ms TimeCoverageRelationStatistics Valid=605, Invalid=2475, Unknown=0, NotChecked=0, Total=3080 [2021-08-30 17:05:46,342 INFO L928 BasicCegarLoop]: 17 mSDtfsCounter, 1813 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 1739 mSolverCounterSat, 383 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1270.65ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1818 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 2122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.51ms SdHoareTripleChecker+Time, 383 IncrementalHoareTripleChecker+Valid, 1739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1492.76ms IncrementalHoareTripleChecker+Time [2021-08-30 17:05:46,343 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [1818 Valid, 23 Invalid, 2122 Unknown, 0 Unchecked, 8.51ms Time], IncrementalHoareTripleChecker [383 Valid, 1739 Invalid, 0 Unknown, 0 Unchecked, 1492.76ms Time] [2021-08-30 17:05:46,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65852 states. [2021-08-30 17:05:47,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65852 to 62939. [2021-08-30 17:05:47,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62939 states, 49584 states have (on average 1.3337770248467247) internal successors, (66134), 55349 states have internal predecessors, (66134), 5038 states have call successors, (5038), 5038 states have call predecessors, (5038), 8306 states have return successors, (18397), 2552 states have call predecessors, (18397), 5037 states have call successors, (18397) [2021-08-30 17:05:48,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62939 states to 62939 states and 89569 transitions. [2021-08-30 17:05:48,072 INFO L78 Accepts]: Start accepts. Automaton has 62939 states and 89569 transitions. Word has length 107 [2021-08-30 17:05:48,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:05:48,072 INFO L470 AbstractCegarLoop]: Abstraction has 62939 states and 89569 transitions. [2021-08-30 17:05:48,072 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.15) internal successors, (103), 16 states have internal predecessors, (103), 8 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (14), 7 states have call predecessors, (14), 8 states have call successors, (14) [2021-08-30 17:05:48,073 INFO L276 IsEmpty]: Start isEmpty. Operand 62939 states and 89569 transitions. [2021-08-30 17:05:48,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-08-30 17:05:48,077 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:05:48,077 INFO L513 BasicCegarLoop]: trace histogram [10, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:05:48,092 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-30 17:05:48,290 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-30 17:05:48,290 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr5ENSURES_VIOLATIONMEMORY_LEAK === [pushErr0REQUIRES_VIOLATION, pushErr1REQUIRES_VIOLATION, pushErr2REQUIRES_VIOLATION, pushErr3REQUIRES_VIOLATION, pushErr4REQUIRES_VIOLATION (and 15 more)] === [2021-08-30 17:05:48,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:05:48,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1851960145, now seen corresponding path program 1 times [2021-08-30 17:05:48,292 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-30 17:05:48,292 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1401771400] [2021-08-30 17:05:48,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:05:48,293 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-30 17:05:48,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-30 17:05:48,294 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-30 17:05:48,296 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-30 17:05:48,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-30 17:05:48,640 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-30 17:05:48,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-30 17:05:49,066 INFO L133 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2021-08-30 17:05:49,067 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-08-30 17:05:49,068 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location mainErr5ENSURES_VIOLATIONMEMORY_LEAK (19 of 20 remaining) [2021-08-30 17:05:49,070 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location pushErr0REQUIRES_VIOLATION (18 of 20 remaining) [2021-08-30 17:05:49,071 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location pushErr1REQUIRES_VIOLATION (17 of 20 remaining) [2021-08-30 17:05:49,071 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location pushErr2REQUIRES_VIOLATION (16 of 20 remaining) [2021-08-30 17:05:49,071 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location pushErr3REQUIRES_VIOLATION (15 of 20 remaining) [2021-08-30 17:05:49,072 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location pushErr4REQUIRES_VIOLATION (14 of 20 remaining) [2021-08-30 17:05:49,072 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location pushErr5REQUIRES_VIOLATION (13 of 20 remaining) [2021-08-30 17:05:49,072 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location pushErr6REQUIRES_VIOLATION (12 of 20 remaining) [2021-08-30 17:05:49,072 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location pushErr7REQUIRES_VIOLATION (11 of 20 remaining) [2021-08-30 17:05:49,072 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location popErr0REQUIRES_VIOLATION (10 of 20 remaining) [2021-08-30 17:05:49,072 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location popErr1REQUIRES_VIOLATION (9 of 20 remaining) [2021-08-30 17:05:49,073 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location popErr2REQUIRES_VIOLATION (8 of 20 remaining) [2021-08-30 17:05:49,073 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location popErr3REQUIRES_VIOLATION (7 of 20 remaining) [2021-08-30 17:05:49,073 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location popErr4REQUIRES_VIOLATION (6 of 20 remaining) [2021-08-30 17:05:49,073 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location popErr5REQUIRES_VIOLATION (5 of 20 remaining) [2021-08-30 17:05:49,073 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr0REQUIRES_VIOLATION (4 of 20 remaining) [2021-08-30 17:05:49,073 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr1REQUIRES_VIOLATION (3 of 20 remaining) [2021-08-30 17:05:49,074 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr2ASSERT_VIOLATIONMEMORY_FREE (2 of 20 remaining) [2021-08-30 17:05:49,074 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr3ASSERT_VIOLATIONMEMORY_FREE (1 of 20 remaining) [2021-08-30 17:05:49,074 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr4ASSERT_VIOLATIONMEMORY_FREE (0 of 20 remaining) [2021-08-30 17:05:49,088 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-30 17:05:49,282 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-30 17:05:49,287 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-30 17:05:49,330 WARN L418 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2021-08-30 17:05:49,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 05:05:49 BoogieIcfgContainer [2021-08-30 17:05:49,388 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-30 17:05:49,389 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-30 17:05:49,390 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-30 17:05:49,390 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-30 17:05:49,391 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 05:04:44" (3/4) ... [2021-08-30 17:05:49,393 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-30 17:05:49,393 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-30 17:05:49,398 INFO L158 Benchmark]: Toolchain (without parser) took 65433.06ms. Allocated memory was 56.6MB in the beginning and 849.3MB in the end (delta: 792.7MB). Free memory was 34.4MB in the beginning and 407.6MB in the end (delta: -373.2MB). Peak memory consumption was 420.3MB. Max. memory is 16.1GB. [2021-08-30 17:05:49,398 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 56.6MB. Free memory was 39.2MB in the beginning and 39.1MB in the end (delta: 53.0kB). There was no memory consumed. Max. memory is 16.1GB. [2021-08-30 17:05:49,399 INFO L158 Benchmark]: CACSL2BoogieTranslator took 428.84ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 34.1MB in the beginning and 45.0MB in the end (delta: -10.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-08-30 17:05:49,399 INFO L158 Benchmark]: Boogie Preprocessor took 84.00ms. Allocated memory is still 69.2MB. Free memory was 44.8MB in the beginning and 41.7MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-08-30 17:05:49,399 INFO L158 Benchmark]: RCFGBuilder took 444.39ms. Allocated memory is still 69.2MB. Free memory was 41.5MB in the beginning and 36.5MB in the end (delta: 5.0MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. [2021-08-30 17:05:49,399 INFO L158 Benchmark]: TraceAbstraction took 64466.71ms. Allocated memory was 69.2MB in the beginning and 849.3MB in the end (delta: 780.1MB). Free memory was 36.0MB in the beginning and 408.6MB in the end (delta: -372.6MB). Peak memory consumption was 408.3MB. Max. memory is 16.1GB. [2021-08-30 17:05:49,400 INFO L158 Benchmark]: Witness Printer took 4.18ms. Allocated memory is still 849.3MB. Free memory was 408.6MB in the beginning and 407.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2021-08-30 17:05:49,403 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.17ms. Allocated memory is still 56.6MB. Free memory was 39.2MB in the beginning and 39.1MB in the end (delta: 53.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 428.84ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 34.1MB in the beginning and 45.0MB in the end (delta: -10.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 84.00ms. Allocated memory is still 69.2MB. Free memory was 44.8MB in the beginning and 41.7MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 444.39ms. Allocated memory is still 69.2MB. Free memory was 41.5MB in the beginning and 36.5MB in the end (delta: 5.0MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. * TraceAbstraction took 64466.71ms. Allocated memory was 69.2MB in the beginning and 849.3MB in the end (delta: 780.1MB). Free memory was 36.0MB in the beginning and 408.6MB in the end (delta: -372.6MB). Peak memory consumption was 408.3MB. Max. memory is 16.1GB. * Witness Printer took 4.18ms. Allocated memory is still 849.3MB. Free memory was 408.6MB in the beginning and 407.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.00ms ErrorAutomatonConstructionTimeTotal, 0.00ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.00ms ErrorAutomatonConstructionTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 592]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 592. Possible FailurePath: [L528] struct cell *S; [L529] int pc1 = 1; [L530] int pc4 = 1; [L531] static struct cell *t1 = ((void *)0); [L532] static struct cell *x1 = ((void *)0); [L561] struct cell* garbage; [L562] static struct cell *t4 = ((void *)0); [L563] static struct cell *x4 = ((void *)0); [L566] static int res4; VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=18, \old(pc4)=28, \old(res4)=22, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L535] pc1++ [L536] case 1: [L537] x1 = malloc(sizeof(*x1)) [L538] x1->data = 0 VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L539] x1->next = ((void *)0) VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L596] RET push() VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=2, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L535] pc1++ [L536] case 1: [L541] case 2: VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=2, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=3, pc1++=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L542] x1->data = 4 VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=2, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=3, pc1++=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L596] RET push() VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=3, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L535] pc1++ [L536] case 1: [L541] case 2: [L544] case 3: [L545] t1 = S VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=3, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=4, pc1++=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L596] RET push() VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=4, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L535] pc1++ [L536] case 1: [L541] case 2: [L544] case 3: [L547] case 4: VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=4, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=5, pc1++=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L548] x1->next = t1 VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=4, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=5, pc1++=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L596] RET push() VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=5, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L535] pc1++ [L536] case 1: [L541] case 2: [L544] case 3: [L547] case 4: [L550] case 5: VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=5, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L551] COND TRUE S == t1 [L552] S = x1 VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=5, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={1:0}, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L596] RET push() VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=6, pc4=1, res4=0, S={1:0}, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND FALSE !(__VERIFIER_nondet_int()) [L598] CALL pop() VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=6, pc4=1, res4=0, S={1:0}, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L567] pc4++ [L568] case 1: [L569] t4 = S VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=6, pc4=2, pc4++=1, res4=0, S={1:0}, t1={0:0}, t4={1:0}, x1={1:0}, x4={0:0}] [L598] RET pop() VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=6, pc4=2, res4=0, S={1:0}, t1={0:0}, t4={1:0}, x1={1:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND FALSE !(__VERIFIER_nondet_int()) [L598] CALL pop() VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=1, \old(pc4)=2, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=6, pc4=2, res4=0, S={1:0}, t1={0:0}, t4={1:0}, x1={1:0}, x4={0:0}] [L567] pc4++ [L568] case 1: [L571] case 2: VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=1, \old(pc4)=2, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=6, pc4=3, pc4++=2, res4=0, S={1:0}, t1={0:0}, t4={1:0}, x1={1:0}, x4={0:0}] [L572] COND FALSE !(t4 == ((void *)0)) VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=1, \old(pc4)=2, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=6, pc4=3, pc4++=2, res4=0, S={1:0}, t1={0:0}, t4={1:0}, x1={1:0}, x4={0:0}] [L598] RET pop() VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=6, pc4=3, res4=0, S={1:0}, t1={0:0}, t4={1:0}, x1={1:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND FALSE !(__VERIFIER_nondet_int()) [L598] CALL pop() VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=1, \old(pc4)=3, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=6, pc4=3, res4=0, S={1:0}, t1={0:0}, t4={1:0}, x1={1:0}, x4={0:0}] [L567] pc4++ [L568] case 1: [L571] case 2: [L575] case 3: VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=1, \old(pc4)=3, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=6, pc4=4, pc4++=3, res4=0, S={1:0}, t1={0:0}, t4={1:0}, x1={1:0}, x4={0:0}] [L576] EXPR t4->next VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=1, \old(pc4)=3, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=6, pc4=4, pc4++=3, res4=0, S={1:0}, t1={0:0}, t4={1:0}, t4->next={0:0}, x1={1:0}, x4={0:0}] [L576] x4 = t4->next [L598] RET pop() VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=6, pc4=4, res4=0, S={1:0}, t1={0:0}, t4={1:0}, x1={1:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND FALSE !(__VERIFIER_nondet_int()) [L598] CALL pop() VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=1, \old(pc4)=4, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=6, pc4=4, res4=0, S={1:0}, t1={0:0}, t4={1:0}, x1={1:0}, x4={0:0}] [L567] pc4++ [L568] case 1: [L571] case 2: [L575] case 3: [L578] case 4: VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=1, \old(pc4)=4, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=6, pc4=5, pc4++=4, res4=0, S={1:0}, t1={0:0}, t4={1:0}, x1={1:0}, x4={0:0}] [L579] COND TRUE S == t4 [L580] S = x4 VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=1, \old(pc4)=4, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=6, pc4=5, pc4++=4, res4=0, S={0:0}, t1={0:0}, t4={1:0}, x1={1:0}, x4={0:0}] [L598] RET pop() VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=6, pc4=5, res4=0, S={0:0}, t1={0:0}, t4={1:0}, x1={1:0}, x4={0:0}] [L594] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L595] COND TRUE __VERIFIER_nondet_int() [L596] CALL push() VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=6, pc4=5, res4=0, S={0:0}, t1={0:0}, t4={1:0}, x1={1:0}, x4={0:0}] [L535] pc1++ [L536] case 1: [L541] case 2: [L544] case 3: [L547] case 4: [L550] case 5: [L556] case 6: [L557] pc1 = 1 VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=1, pc1++=6, pc4=5, res4=0, S={0:0}, t1={0:0}, t4={1:0}, x1={1:0}, x4={0:0}] [L596] RET push() VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=1, pc4=5, res4=0, S={0:0}, t1={0:0}, t4={1:0}, x1={1:0}, x4={0:0}] [L594] COND FALSE !(S || 1 != pc1 || __VERIFIER_nondet_int()) [L600] COND FALSE !(\read(*garbage)) VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, garbage={0:0}, pc1=1, pc4=5, res4=0, S={0:0}, t1={0:0}, t4={1:0}, x1={1:0}, x4={0:0}] [L605] S = ((void *)0) [L606] t1 = ((void *)0) [L607] x1 = ((void *)0) [L608] t4 = ((void *)0) [L609] x4 = ((void *)0) [L610] return !!garbage; VAL [\old(garbage)=null, \old(garbage)=null, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=null, \old(S)=null, \old(t1)=null, \old(t1)=null, \old(t4)=null, \old(t4)=null, \old(x1)=null, \old(x1)=null, \old(x4)=null, \old(x4)=null, \result=0, garbage={0:0}, pc1=1, pc4=5, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] - UnprovableResult [Line: 538]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 539]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 539]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 542]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 542]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 548]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 548]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 576]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 576]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 585]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 585]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 586]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 586]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 601]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 601]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 12 procedures, 96 locations, 20 error locations. Started 1 CEGAR loops. OverallTime: 64308.17ms, OverallIterations: 24, TraceHistogramMax: 10, EmptinessCheckTime: 60.77ms, AutomataDifference: 35779.25ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 0.00ms, InitialAbstractionConstructionTime: 10.70ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 16342 SdHoareTripleChecker+Valid, 22099.54ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16301 mSDsluCounter, 531 SdHoareTripleChecker+Invalid, 18774.73ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1276 IncrementalHoareTripleChecker+Unchecked, 5964 mSDsCounter, 3892 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21969 IncrementalHoareTripleChecker+Invalid, 27137 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3892 mSolverCounterUnsat, 316 mSDtfsCounter, 21969 mSolverCounterSat, 148.02ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2269 GetRequests, 1656 SyntacticMatches, 10 SemanticMatches, 603 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6127 ImplicationChecksByTransitivity, 14764.04ms Time, 0.00ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=62939occurred in iteration=23, InterpolantAutomatonStates: 469, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.00ms DumpTime, AutomataMinimizationStatistics: 4214.54ms AutomataMinimizationTime, 23 MinimizatonAttempts, 14474 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 442.79ms SsaConstructionTime, 1896.58ms SatisfiabilityAnalysisTime, 14529.23ms InterpolantComputationTime, 1039 NumberOfCodeBlocks, 1039 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1814 ConstructedInterpolants, 20 QuantifiedInterpolants, 11966 SizeOfPredicates, 83 NumberOfNonLiveVariables, 6593 ConjunctsInSsa, 325 ConjunctsInUnsatCore, 46 InterpolantComputations, 14 PerfectInterpolantSequences, 1431/2450 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-30 17:05:49,451 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...