./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/list-ext3-properties/dll_nullified-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 20ed64ec Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-ext3-properties/dll_nullified-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c6bee9027c6ee41df2f7df0c67f6de4e3d806cb7 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup) --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-27 04:26:46,561 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 04:26:46,562 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 04:26:46,579 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 04:26:46,579 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 04:26:46,580 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 04:26:46,581 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 04:26:46,582 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 04:26:46,583 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 04:26:46,583 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 04:26:46,584 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 04:26:46,585 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 04:26:46,585 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 04:26:46,586 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 04:26:46,586 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 04:26:46,587 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 04:26:46,588 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 04:26:46,588 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 04:26:46,589 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 04:26:46,590 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 04:26:46,591 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 04:26:46,593 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 04:26:46,594 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 04:26:46,595 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 04:26:46,597 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 04:26:46,601 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 04:26:46,601 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 04:26:46,602 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 04:26:46,604 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 04:26:46,605 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 04:26:46,605 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 04:26:46,605 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 04:26:46,606 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 04:26:46,606 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 04:26:46,607 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 04:26:46,608 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 04:26:46,608 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 04:26:46,609 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 04:26:46,609 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 04:26:46,610 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 04:26:46,611 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 04:26:46,611 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2021-08-27 04:26:46,640 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 04:26:46,642 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 04:26:46,643 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 04:26:46,643 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 04:26:46,644 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 04:26:46,644 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 04:26:46,644 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 04:26:46,644 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 04:26:46,645 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 04:26:46,645 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 04:26:46,645 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 04:26:46,646 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 04:26:46,646 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 04:26:46,646 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-08-27 04:26:46,646 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-08-27 04:26:46,646 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-27 04:26:46,646 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-08-27 04:26:46,646 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 04:26:46,647 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 04:26:46,647 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 04:26:46,647 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 04:26:46,647 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-27 04:26:46,647 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 04:26:46,647 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 04:26:46,647 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-27 04:26:46,648 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 04:26:46,648 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-27 04:26:46,648 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 04:26:46,648 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-memcleanup) ) 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 -> c6bee9027c6ee41df2f7df0c67f6de4e3d806cb7 [2021-08-27 04:26:46,894 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 04:26:46,908 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 04:26:46,910 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 04:26:46,911 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 04:26:46,912 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 04:26:46,913 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext3-properties/dll_nullified-1.i [2021-08-27 04:26:46,964 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34ce1d32f/e4ac80c3f99d4581922e81b3557fb9a5/FLAGd7753982b [2021-08-27 04:26:47,354 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 04:26:47,354 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/dll_nullified-1.i [2021-08-27 04:26:47,361 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34ce1d32f/e4ac80c3f99d4581922e81b3557fb9a5/FLAGd7753982b [2021-08-27 04:26:47,371 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34ce1d32f/e4ac80c3f99d4581922e81b3557fb9a5 [2021-08-27 04:26:47,373 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 04:26:47,374 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-27 04:26:47,374 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 04:26:47,374 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 04:26:47,377 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 04:26:47,377 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 04:26:47" (1/1) ... [2021-08-27 04:26:47,378 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b02a9ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:47, skipping insertion in model container [2021-08-27 04:26:47,378 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 04:26:47" (1/1) ... [2021-08-27 04:26:47,382 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 04:26:47,399 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 04:26:47,572 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/dll_nullified-1.i[24046,24059] [2021-08-27 04:26:47,574 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 04:26:47,578 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 04:26:47,608 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/dll_nullified-1.i[24046,24059] [2021-08-27 04:26:47,614 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 04:26:47,637 INFO L208 MainTranslator]: Completed translation [2021-08-27 04:26:47,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:47 WrapperNode [2021-08-27 04:26:47,637 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 04:26:47,638 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 04:26:47,639 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 04:26:47,639 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 04:26:47,646 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:47" (1/1) ... [2021-08-27 04:26:47,647 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:47" (1/1) ... [2021-08-27 04:26:47,669 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:47" (1/1) ... [2021-08-27 04:26:47,670 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:47" (1/1) ... [2021-08-27 04:26:47,685 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:47" (1/1) ... [2021-08-27 04:26:47,688 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:47" (1/1) ... [2021-08-27 04:26:47,690 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:47" (1/1) ... [2021-08-27 04:26:47,693 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 04:26:47,693 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 04:26:47,693 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 04:26:47,694 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 04:26:47,694 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:47" (1/1) ... [2021-08-27 04:26:47,698 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 04:26:47,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 04:26:47,710 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-27 04:26:47,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-27 04:26:47,747 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-08-27 04:26:47,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 04:26:47,748 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-08-27 04:26:47,748 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2021-08-27 04:26:47,748 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2021-08-27 04:26:47,748 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2021-08-27 04:26:47,749 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2021-08-27 04:26:47,749 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-08-27 04:26:47,749 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-08-27 04:26:47,749 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-08-27 04:26:47,749 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-08-27 04:26:47,750 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-08-27 04:26:47,750 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-08-27 04:26:47,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 04:26:47,750 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-08-27 04:26:47,750 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2021-08-27 04:26:47,750 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2021-08-27 04:26:47,750 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2021-08-27 04:26:47,750 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2021-08-27 04:26:47,750 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2021-08-27 04:26:47,750 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2021-08-27 04:26:47,750 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2021-08-27 04:26:47,750 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2021-08-27 04:26:47,750 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2021-08-27 04:26:47,750 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2021-08-27 04:26:47,750 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2021-08-27 04:26:47,751 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2021-08-27 04:26:47,751 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2021-08-27 04:26:47,751 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2021-08-27 04:26:47,751 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2021-08-27 04:26:47,751 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2021-08-27 04:26:47,751 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2021-08-27 04:26:47,751 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2021-08-27 04:26:47,751 INFO L130 BoogieDeclarations]: Found specification of procedure select [2021-08-27 04:26:47,751 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2021-08-27 04:26:47,751 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2021-08-27 04:26:47,751 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2021-08-27 04:26:47,751 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2021-08-27 04:26:47,751 INFO L130 BoogieDeclarations]: Found specification of procedure random [2021-08-27 04:26:47,751 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2021-08-27 04:26:47,751 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2021-08-27 04:26:47,752 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2021-08-27 04:26:47,752 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2021-08-27 04:26:47,752 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2021-08-27 04:26:47,752 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2021-08-27 04:26:47,752 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2021-08-27 04:26:47,752 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2021-08-27 04:26:47,752 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2021-08-27 04:26:47,752 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2021-08-27 04:26:47,753 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2021-08-27 04:26:47,753 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2021-08-27 04:26:47,753 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2021-08-27 04:26:47,753 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2021-08-27 04:26:47,753 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2021-08-27 04:26:47,753 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2021-08-27 04:26:47,753 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2021-08-27 04:26:47,753 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2021-08-27 04:26:47,753 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2021-08-27 04:26:47,754 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2021-08-27 04:26:47,754 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2021-08-27 04:26:47,754 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2021-08-27 04:26:47,754 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2021-08-27 04:26:47,754 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2021-08-27 04:26:47,754 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2021-08-27 04:26:47,754 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2021-08-27 04:26:47,754 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2021-08-27 04:26:47,754 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2021-08-27 04:26:47,755 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-08-27 04:26:47,755 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-08-27 04:26:47,755 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2021-08-27 04:26:47,755 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-08-27 04:26:47,755 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2021-08-27 04:26:47,755 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2021-08-27 04:26:47,755 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2021-08-27 04:26:47,755 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2021-08-27 04:26:47,755 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2021-08-27 04:26:47,755 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2021-08-27 04:26:47,756 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2021-08-27 04:26:47,756 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2021-08-27 04:26:47,756 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2021-08-27 04:26:47,756 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2021-08-27 04:26:47,756 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2021-08-27 04:26:47,756 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2021-08-27 04:26:47,756 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2021-08-27 04:26:47,756 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2021-08-27 04:26:47,756 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2021-08-27 04:26:47,757 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2021-08-27 04:26:47,757 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2021-08-27 04:26:47,757 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2021-08-27 04:26:47,757 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2021-08-27 04:26:47,757 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2021-08-27 04:26:47,757 INFO L130 BoogieDeclarations]: Found specification of procedure system [2021-08-27 04:26:47,757 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2021-08-27 04:26:47,757 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2021-08-27 04:26:47,757 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2021-08-27 04:26:47,757 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2021-08-27 04:26:47,757 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2021-08-27 04:26:47,757 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2021-08-27 04:26:47,757 INFO L130 BoogieDeclarations]: Found specification of procedure div [2021-08-27 04:26:47,757 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2021-08-27 04:26:47,757 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2021-08-27 04:26:47,757 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2021-08-27 04:26:47,757 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2021-08-27 04:26:47,757 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2021-08-27 04:26:47,757 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2021-08-27 04:26:47,758 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2021-08-27 04:26:47,758 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2021-08-27 04:26:47,758 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2021-08-27 04:26:47,758 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2021-08-27 04:26:47,758 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2021-08-27 04:26:47,758 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2021-08-27 04:26:47,759 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2021-08-27 04:26:47,759 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2021-08-27 04:26:47,759 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2021-08-27 04:26:47,759 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2021-08-27 04:26:47,759 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2021-08-27 04:26:47,759 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2021-08-27 04:26:47,759 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2021-08-27 04:26:47,759 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2021-08-27 04:26:47,759 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2021-08-27 04:26:47,759 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2021-08-27 04:26:47,759 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-08-27 04:26:47,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-27 04:26:47,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-27 04:26:47,759 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-08-27 04:26:47,759 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-27 04:26:47,759 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-27 04:26:47,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-27 04:26:47,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-08-27 04:26:47,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-27 04:26:47,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 04:26:48,108 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2021-08-27 04:26:48,344 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 04:26:48,344 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2021-08-27 04:26:48,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 04:26:48 BoogieIcfgContainer [2021-08-27 04:26:48,346 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 04:26:48,347 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-27 04:26:48,347 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-27 04:26:48,349 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-27 04:26:48,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 04:26:47" (1/3) ... [2021-08-27 04:26:48,349 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cb267a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 04:26:48, skipping insertion in model container [2021-08-27 04:26:48,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:47" (2/3) ... [2021-08-27 04:26:48,350 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cb267a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 04:26:48, skipping insertion in model container [2021-08-27 04:26:48,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 04:26:48" (3/3) ... [2021-08-27 04:26:48,351 INFO L111 eAbstractionObserver]: Analyzing ICFG dll_nullified-1.i [2021-08-27 04:26:48,354 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-27 04:26:48,354 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 35 error locations. [2021-08-27 04:26:48,378 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-27 04:26:48,382 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-27 04:26:48,382 INFO L340 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2021-08-27 04:26:48,397 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 56 states have (on average 1.8928571428571428) internal successors, (106), 91 states have internal predecessors, (106), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-27 04:26:48,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-08-27 04:26:48,404 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:48,404 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:48,404 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting dll_createErr0REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 30 more)] === [2021-08-27 04:26:48,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:48,410 INFO L82 PathProgramCache]: Analyzing trace with hash -2056030063, now seen corresponding path program 1 times [2021-08-27 04:26:48,415 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:48,416 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313495559] [2021-08-27 04:26:48,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:48,417 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:48,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:48,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:48,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:48,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:48,614 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:48,614 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313495559] [2021-08-27 04:26:48,614 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313495559] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:48,614 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:48,615 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 04:26:48,616 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509208082] [2021-08-27 04:26:48,618 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 04:26:48,624 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:48,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 04:26:48,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 04:26:48,637 INFO L87 Difference]: Start difference. First operand has 99 states, 56 states have (on average 1.8928571428571428) internal successors, (106), 91 states have internal predecessors, (106), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-27 04:26:48,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:48,856 INFO L93 Difference]: Finished difference Result 155 states and 173 transitions. [2021-08-27 04:26:48,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 04:26:48,857 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 11 [2021-08-27 04:26:48,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:48,862 INFO L225 Difference]: With dead ends: 155 [2021-08-27 04:26:48,862 INFO L226 Difference]: Without dead ends: 146 [2021-08-27 04:26:48,863 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 52.8ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 04:26:48,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-08-27 04:26:48,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 108. [2021-08-27 04:26:48,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 72 states have (on average 1.75) internal successors, (126), 101 states have internal predecessors, (126), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-08-27 04:26:48,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 132 transitions. [2021-08-27 04:26:48,886 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 132 transitions. Word has length 11 [2021-08-27 04:26:48,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:48,886 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 132 transitions. [2021-08-27 04:26:48,886 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-27 04:26:48,886 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 132 transitions. [2021-08-27 04:26:48,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-08-27 04:26:48,887 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:48,887 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:48,887 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-27 04:26:48,887 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting dll_createErr1REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 30 more)] === [2021-08-27 04:26:48,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:48,888 INFO L82 PathProgramCache]: Analyzing trace with hash -2056030062, now seen corresponding path program 1 times [2021-08-27 04:26:48,888 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:48,888 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265729989] [2021-08-27 04:26:48,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:48,888 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:48,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:48,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:48,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:48,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:48,982 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:48,982 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265729989] [2021-08-27 04:26:48,982 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265729989] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:48,982 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:48,982 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 04:26:48,982 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91272707] [2021-08-27 04:26:48,983 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 04:26:48,983 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:48,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 04:26:48,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 04:26:48,983 INFO L87 Difference]: Start difference. First operand 108 states and 132 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-27 04:26:49,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:49,213 INFO L93 Difference]: Finished difference Result 141 states and 157 transitions. [2021-08-27 04:26:49,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 04:26:49,213 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 11 [2021-08-27 04:26:49,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:49,217 INFO L225 Difference]: With dead ends: 141 [2021-08-27 04:26:49,217 INFO L226 Difference]: Without dead ends: 141 [2021-08-27 04:26:49,218 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 24.4ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 04:26:49,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-08-27 04:26:49,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 103. [2021-08-27 04:26:49,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 72 states have (on average 1.6805555555555556) internal successors, (121), 96 states have internal predecessors, (121), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-08-27 04:26:49,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 127 transitions. [2021-08-27 04:26:49,233 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 127 transitions. Word has length 11 [2021-08-27 04:26:49,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:49,233 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 127 transitions. [2021-08-27 04:26:49,233 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-27 04:26:49,233 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 127 transitions. [2021-08-27 04:26:49,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-08-27 04:26:49,234 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:49,234 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:49,234 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-27 04:26:49,234 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 30 more)] === [2021-08-27 04:26:49,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:49,235 INFO L82 PathProgramCache]: Analyzing trace with hash -683912238, now seen corresponding path program 1 times [2021-08-27 04:26:49,235 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:49,235 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98139520] [2021-08-27 04:26:49,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:49,235 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:49,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:49,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:49,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:49,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 04:26:49,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:49,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:49,319 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:49,319 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98139520] [2021-08-27 04:26:49,319 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98139520] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:49,319 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:49,319 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-27 04:26:49,319 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043003924] [2021-08-27 04:26:49,319 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 04:26:49,319 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:49,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 04:26:49,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-27 04:26:49,320 INFO L87 Difference]: Start difference. First operand 103 states and 127 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 04:26:49,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:49,541 INFO L93 Difference]: Finished difference Result 101 states and 112 transitions. [2021-08-27 04:26:49,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 04:26:49,545 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 14 [2021-08-27 04:26:49,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:49,545 INFO L225 Difference]: With dead ends: 101 [2021-08-27 04:26:49,545 INFO L226 Difference]: Without dead ends: 98 [2021-08-27 04:26:49,546 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 110.4ms TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-08-27 04:26:49,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-08-27 04:26:49,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 84. [2021-08-27 04:26:49,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 54 states have (on average 1.6296296296296295) internal successors, (88), 78 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 04:26:49,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 93 transitions. [2021-08-27 04:26:49,548 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 93 transitions. Word has length 14 [2021-08-27 04:26:49,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:49,548 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 93 transitions. [2021-08-27 04:26:49,549 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 04:26:49,549 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2021-08-27 04:26:49,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-27 04:26:49,549 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:49,549 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:49,549 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-27 04:26:49,549 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting dll_createErr10REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 30 more)] === [2021-08-27 04:26:49,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:49,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1129091757, now seen corresponding path program 1 times [2021-08-27 04:26:49,550 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:49,550 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394521896] [2021-08-27 04:26:49,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:49,550 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:49,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:49,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:49,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:49,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:49,615 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:49,615 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394521896] [2021-08-27 04:26:49,615 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394521896] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:49,616 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:49,616 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 04:26:49,616 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414778273] [2021-08-27 04:26:49,616 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 04:26:49,616 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:49,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 04:26:49,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 04:26:49,617 INFO L87 Difference]: Start difference. First operand 84 states and 93 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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-27 04:26:49,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:49,749 INFO L93 Difference]: Finished difference Result 95 states and 105 transitions. [2021-08-27 04:26:49,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 04:26:49,750 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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 20 [2021-08-27 04:26:49,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:49,751 INFO L225 Difference]: With dead ends: 95 [2021-08-27 04:26:49,751 INFO L226 Difference]: Without dead ends: 95 [2021-08-27 04:26:49,751 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 32.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 04:26:49,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-08-27 04:26:49,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2021-08-27 04:26:49,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 64 states have (on average 1.546875) internal successors, (99), 88 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 04:26:49,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2021-08-27 04:26:49,754 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 20 [2021-08-27 04:26:49,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:49,754 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2021-08-27 04:26:49,755 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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-27 04:26:49,755 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2021-08-27 04:26:49,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-08-27 04:26:49,755 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:49,755 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:49,755 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-27 04:26:49,756 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 30 more)] === [2021-08-27 04:26:49,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:49,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1531598106, now seen corresponding path program 1 times [2021-08-27 04:26:49,756 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:49,756 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668737384] [2021-08-27 04:26:49,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:49,757 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:49,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:49,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:49,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:49,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 04:26:49,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:49,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:49,850 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:49,850 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668737384] [2021-08-27 04:26:49,850 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668737384] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:49,850 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:49,850 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 04:26:49,850 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465696800] [2021-08-27 04:26:49,851 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 04:26:49,851 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:49,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 04:26:49,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-08-27 04:26:49,851 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 04:26:50,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:50,097 INFO L93 Difference]: Finished difference Result 94 states and 104 transitions. [2021-08-27 04:26:50,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 04:26:50,098 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2021-08-27 04:26:50,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:50,098 INFO L225 Difference]: With dead ends: 94 [2021-08-27 04:26:50,098 INFO L226 Difference]: Without dead ends: 94 [2021-08-27 04:26:50,099 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 70.4ms TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-08-27 04:26:50,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2021-08-27 04:26:50,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 88. [2021-08-27 04:26:50,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 67 states have (on average 1.4328358208955223) internal successors, (96), 82 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 04:26:50,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 101 transitions. [2021-08-27 04:26:50,101 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 101 transitions. Word has length 26 [2021-08-27 04:26:50,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:50,102 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 101 transitions. [2021-08-27 04:26:50,102 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 04:26:50,102 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 101 transitions. [2021-08-27 04:26:50,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-08-27 04:26:50,102 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:50,103 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:50,103 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-27 04:26:50,103 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr1REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 30 more)] === [2021-08-27 04:26:50,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:50,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1531598105, now seen corresponding path program 1 times [2021-08-27 04:26:50,103 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:50,104 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020532887] [2021-08-27 04:26:50,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:50,104 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:50,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:50,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:50,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:50,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 04:26:50,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:50,179 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:50,180 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:50,180 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020532887] [2021-08-27 04:26:50,180 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020532887] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 04:26:50,180 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1085909764] [2021-08-27 04:26:50,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:50,180 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 04:26:50,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 04:26:50,182 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 04:26:50,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-08-27 04:26:50,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:50,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-27 04:26:50,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 04:26:50,479 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:50,479 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1085909764] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 04:26:50,479 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 04:26:50,480 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 9 [2021-08-27 04:26:50,480 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103622415] [2021-08-27 04:26:50,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 04:26:50,480 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:50,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 04:26:50,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-08-27 04:26:50,481 INFO L87 Difference]: Start difference. First operand 88 states and 101 transitions. Second operand has 9 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 04:26:50,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:50,687 INFO L93 Difference]: Finished difference Result 106 states and 121 transitions. [2021-08-27 04:26:50,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 04:26:50,692 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2021-08-27 04:26:50,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:50,693 INFO L225 Difference]: With dead ends: 106 [2021-08-27 04:26:50,693 INFO L226 Difference]: Without dead ends: 103 [2021-08-27 04:26:50,693 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 122.6ms TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2021-08-27 04:26:50,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2021-08-27 04:26:50,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 90. [2021-08-27 04:26:50,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 69 states have (on average 1.4202898550724639) internal successors, (98), 84 states have internal predecessors, (98), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 04:26:50,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 103 transitions. [2021-08-27 04:26:50,704 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 103 transitions. Word has length 26 [2021-08-27 04:26:50,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:50,704 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 103 transitions. [2021-08-27 04:26:50,704 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 04:26:50,705 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 103 transitions. [2021-08-27 04:26:50,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-08-27 04:26:50,705 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:50,705 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:50,726 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-08-27 04:26:50,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,SelfDestructingSolverStorable5 [2021-08-27 04:26:50,921 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting dll_createErr11REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 30 more)] === [2021-08-27 04:26:50,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:50,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1306178878, now seen corresponding path program 1 times [2021-08-27 04:26:50,922 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:50,922 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488322671] [2021-08-27 04:26:50,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:50,922 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:50,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:51,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:51,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:51,029 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:51,029 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:51,029 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488322671] [2021-08-27 04:26:51,030 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488322671] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 04:26:51,030 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2141291604] [2021-08-27 04:26:51,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:51,030 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 04:26:51,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 04:26:51,031 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 04:26:51,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-08-27 04:26:51,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:51,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 12 conjunts are in the unsatisfiable core [2021-08-27 04:26:51,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 04:26:51,215 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 04:26:51,219 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 04:26:51,399 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-08-27 04:26:51,400 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 24 [2021-08-27 04:26:51,406 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 04:26:51,407 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2021-08-27 04:26:51,620 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:51,621 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2141291604] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 04:26:51,621 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 04:26:51,621 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2021-08-27 04:26:51,621 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361111157] [2021-08-27 04:26:51,621 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 04:26:51,622 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:51,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 04:26:51,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-27 04:26:51,622 INFO L87 Difference]: Start difference. First operand 90 states and 103 transitions. Second operand has 8 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:51,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:51,809 INFO L93 Difference]: Finished difference Result 89 states and 102 transitions. [2021-08-27 04:26:51,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 04:26:51,810 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2021-08-27 04:26:51,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:51,810 INFO L225 Difference]: With dead ends: 89 [2021-08-27 04:26:51,810 INFO L226 Difference]: Without dead ends: 89 [2021-08-27 04:26:51,811 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 71.1ms TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-08-27 04:26:51,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-08-27 04:26:51,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2021-08-27 04:26:51,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 69 states have (on average 1.4057971014492754) internal successors, (97), 83 states have internal predecessors, (97), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 04:26:51,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 102 transitions. [2021-08-27 04:26:51,813 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 102 transitions. Word has length 32 [2021-08-27 04:26:51,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:51,813 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 102 transitions. [2021-08-27 04:26:51,813 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:51,813 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 102 transitions. [2021-08-27 04:26:51,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-08-27 04:26:51,814 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:51,814 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:51,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-08-27 04:26:52,021 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,SelfDestructingSolverStorable6 [2021-08-27 04:26:52,021 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr1REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 30 more)] === [2021-08-27 04:26:52,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:52,022 INFO L82 PathProgramCache]: Analyzing trace with hash 773915643, now seen corresponding path program 2 times [2021-08-27 04:26:52,022 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:52,022 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836760400] [2021-08-27 04:26:52,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:52,022 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:52,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:52,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:52,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:52,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 04:26:52,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:52,092 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:52,092 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:52,092 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836760400] [2021-08-27 04:26:52,092 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836760400] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 04:26:52,092 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355547406] [2021-08-27 04:26:52,093 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-27 04:26:52,093 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 04:26:52,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 04:26:52,094 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 04:26:52,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-08-27 04:26:52,286 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-27 04:26:52,286 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 04:26:52,288 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-27 04:26:52,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 04:26:52,411 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:52,411 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [355547406] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 04:26:52,411 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 04:26:52,412 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2021-08-27 04:26:52,412 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716935965] [2021-08-27 04:26:52,412 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-27 04:26:52,412 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:52,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-27 04:26:52,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-08-27 04:26:52,413 INFO L87 Difference]: Start difference. First operand 89 states and 102 transitions. Second operand has 11 states, 10 states have (on average 6.3) internal successors, (63), 9 states have internal predecessors, (63), 2 states have call successors, (5), 3 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-27 04:26:52,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:52,697 INFO L93 Difference]: Finished difference Result 117 states and 131 transitions. [2021-08-27 04:26:52,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 04:26:52,698 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.3) internal successors, (63), 9 states have internal predecessors, (63), 2 states have call successors, (5), 3 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 38 [2021-08-27 04:26:52,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:52,699 INFO L225 Difference]: With dead ends: 117 [2021-08-27 04:26:52,699 INFO L226 Difference]: Without dead ends: 114 [2021-08-27 04:26:52,701 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 142.0ms TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2021-08-27 04:26:52,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-08-27 04:26:52,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 102. [2021-08-27 04:26:52,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 82 states have (on average 1.3414634146341464) internal successors, (110), 96 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 04:26:52,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 115 transitions. [2021-08-27 04:26:52,703 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 115 transitions. Word has length 38 [2021-08-27 04:26:52,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:52,705 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 115 transitions. [2021-08-27 04:26:52,707 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.3) internal successors, (63), 9 states have internal predecessors, (63), 2 states have call successors, (5), 3 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-27 04:26:52,707 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 115 transitions. [2021-08-27 04:26:52,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-08-27 04:26:52,712 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:52,713 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:52,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-08-27 04:26:52,924 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 04:26:52,925 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr1REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 30 more)] === [2021-08-27 04:26:52,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:52,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1265167833, now seen corresponding path program 1 times [2021-08-27 04:26:52,925 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:52,926 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058148644] [2021-08-27 04:26:52,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:52,926 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:52,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:52,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:52,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:52,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 04:26:52,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:53,034 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:53,035 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:53,035 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058148644] [2021-08-27 04:26:53,035 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058148644] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 04:26:53,035 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578173412] [2021-08-27 04:26:53,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:53,035 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 04:26:53,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 04:26:53,036 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-27 04:26:53,064 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-27 04:26:53,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:53,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 7 conjunts are in the unsatisfiable core [2021-08-27 04:26:53,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 04:26:53,361 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:53,361 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1578173412] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 04:26:53,361 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 04:26:53,361 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 11 [2021-08-27 04:26:53,361 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926375628] [2021-08-27 04:26:53,362 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-27 04:26:53,362 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:53,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-27 04:26:53,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-08-27 04:26:53,363 INFO L87 Difference]: Start difference. First operand 102 states and 115 transitions. Second operand has 11 states, 10 states have (on average 6.1) internal successors, (61), 9 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 04:26:53,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:53,546 INFO L93 Difference]: Finished difference Result 130 states and 145 transitions. [2021-08-27 04:26:53,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 04:26:53,546 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.1) internal successors, (61), 9 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 52 [2021-08-27 04:26:53,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:53,547 INFO L225 Difference]: With dead ends: 130 [2021-08-27 04:26:53,547 INFO L226 Difference]: Without dead ends: 127 [2021-08-27 04:26:53,548 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 108.4ms TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2021-08-27 04:26:53,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2021-08-27 04:26:53,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 115. [2021-08-27 04:26:53,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 95 states have (on average 1.305263157894737) internal successors, (124), 109 states have internal predecessors, (124), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 04:26:53,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 129 transitions. [2021-08-27 04:26:53,550 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 129 transitions. Word has length 52 [2021-08-27 04:26:53,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:53,551 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 129 transitions. [2021-08-27 04:26:53,551 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.1) internal successors, (61), 9 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 04:26:53,551 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 129 transitions. [2021-08-27 04:26:53,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-08-27 04:26:53,551 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:53,552 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:53,569 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-27 04:26:53,764 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 04:26:53,764 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr1REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 30 more)] === [2021-08-27 04:26:53,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:53,765 INFO L82 PathProgramCache]: Analyzing trace with hash -638876471, now seen corresponding path program 2 times [2021-08-27 04:26:53,765 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:53,765 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421312778] [2021-08-27 04:26:53,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:53,765 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:53,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:53,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:53,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:53,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 04:26:53,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:53,908 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:53,908 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:53,908 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421312778] [2021-08-27 04:26:53,908 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421312778] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 04:26:53,908 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [302766678] [2021-08-27 04:26:53,908 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-27 04:26:53,909 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 04:26:53,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 04:26:53,913 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-27 04:26:53,940 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-27 04:26:54,139 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-27 04:26:54,139 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 04:26:54,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-27 04:26:54,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 04:26:54,330 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:54,331 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [302766678] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 04:26:54,331 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 04:26:54,331 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 12 [2021-08-27 04:26:54,331 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21165514] [2021-08-27 04:26:54,332 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 04:26:54,332 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:54,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 04:26:54,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-08-27 04:26:54,332 INFO L87 Difference]: Start difference. First operand 115 states and 129 transitions. Second operand has 12 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 10 states have internal predecessors, (74), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 04:26:54,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:54,538 INFO L93 Difference]: Finished difference Result 143 states and 159 transitions. [2021-08-27 04:26:54,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 04:26:54,539 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 10 states have internal predecessors, (74), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 65 [2021-08-27 04:26:54,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:54,539 INFO L225 Difference]: With dead ends: 143 [2021-08-27 04:26:54,540 INFO L226 Difference]: Without dead ends: 140 [2021-08-27 04:26:54,540 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 122.3ms TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2021-08-27 04:26:54,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2021-08-27 04:26:54,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 128. [2021-08-27 04:26:54,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 108 states have (on average 1.2777777777777777) internal successors, (138), 122 states have internal predecessors, (138), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 04:26:54,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 143 transitions. [2021-08-27 04:26:54,542 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 143 transitions. Word has length 65 [2021-08-27 04:26:54,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:54,543 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 143 transitions. [2021-08-27 04:26:54,543 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 10 states have internal predecessors, (74), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 04:26:54,543 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 143 transitions. [2021-08-27 04:26:54,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-08-27 04:26:54,543 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:54,544 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:54,563 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-27 04:26:54,756 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,SelfDestructingSolverStorable9 [2021-08-27 04:26:54,757 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr1REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 30 more)] === [2021-08-27 04:26:54,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:54,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1355159193, now seen corresponding path program 3 times [2021-08-27 04:26:54,757 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:54,757 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629159381] [2021-08-27 04:26:54,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:54,757 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:54,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:54,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:54,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:54,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 04:26:54,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:54,930 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2021-08-27 04:26:54,931 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:54,931 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629159381] [2021-08-27 04:26:54,931 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629159381] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:54,931 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:54,931 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 04:26:54,931 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116453702] [2021-08-27 04:26:54,931 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 04:26:54,932 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:54,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 04:26:54,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-08-27 04:26:54,932 INFO L87 Difference]: Start difference. First operand 128 states and 143 transitions. Second operand has 9 states, 8 states have (on average 4.5) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 04:26:55,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:55,190 INFO L93 Difference]: Finished difference Result 163 states and 183 transitions. [2021-08-27 04:26:55,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 04:26:55,191 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 78 [2021-08-27 04:26:55,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:55,192 INFO L225 Difference]: With dead ends: 163 [2021-08-27 04:26:55,192 INFO L226 Difference]: Without dead ends: 163 [2021-08-27 04:26:55,192 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 83.9ms TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-08-27 04:26:55,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2021-08-27 04:26:55,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 154. [2021-08-27 04:26:55,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 134 states have (on average 1.2761194029850746) internal successors, (171), 148 states have internal predecessors, (171), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 04:26:55,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 176 transitions. [2021-08-27 04:26:55,195 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 176 transitions. Word has length 78 [2021-08-27 04:26:55,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:55,195 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 176 transitions. [2021-08-27 04:26:55,195 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 04:26:55,195 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 176 transitions. [2021-08-27 04:26:55,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-08-27 04:26:55,196 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:55,196 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:55,196 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-27 04:26:55,196 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr22ENSURES_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 30 more)] === [2021-08-27 04:26:55,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:55,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1136298550, now seen corresponding path program 1 times [2021-08-27 04:26:55,197 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:55,197 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662693108] [2021-08-27 04:26:55,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:55,197 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:55,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:55,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:55,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:55,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 04:26:55,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:55,312 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2021-08-27 04:26:55,312 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:55,312 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662693108] [2021-08-27 04:26:55,312 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662693108] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:55,313 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:55,313 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-27 04:26:55,313 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676457510] [2021-08-27 04:26:55,313 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 04:26:55,313 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:55,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 04:26:55,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-08-27 04:26:55,314 INFO L87 Difference]: Start difference. First operand 154 states and 176 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 04:26:55,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:55,528 INFO L93 Difference]: Finished difference Result 160 states and 180 transitions. [2021-08-27 04:26:55,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 04:26:55,528 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 82 [2021-08-27 04:26:55,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:55,529 INFO L225 Difference]: With dead ends: 160 [2021-08-27 04:26:55,529 INFO L226 Difference]: Without dead ends: 160 [2021-08-27 04:26:55,529 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 65.0ms TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-08-27 04:26:55,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-08-27 04:26:55,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 154. [2021-08-27 04:26:55,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 134 states have (on average 1.2686567164179106) internal successors, (170), 148 states have internal predecessors, (170), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 04:26:55,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 175 transitions. [2021-08-27 04:26:55,532 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 175 transitions. Word has length 82 [2021-08-27 04:26:55,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:55,532 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 175 transitions. [2021-08-27 04:26:55,532 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 04:26:55,533 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 175 transitions. [2021-08-27 04:26:55,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-08-27 04:26:55,533 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:55,533 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:55,533 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-27 04:26:55,534 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr21ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 30 more)] === [2021-08-27 04:26:55,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:55,534 INFO L82 PathProgramCache]: Analyzing trace with hash -22511990, now seen corresponding path program 1 times [2021-08-27 04:26:55,534 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:55,534 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146190803] [2021-08-27 04:26:55,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:55,534 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:55,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:55,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:55,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:55,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 04:26:55,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:55,776 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 74 proven. 11 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-08-27 04:26:55,776 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:55,776 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146190803] [2021-08-27 04:26:55,777 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146190803] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 04:26:55,777 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1144521747] [2021-08-27 04:26:55,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:55,777 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 04:26:55,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 04:26:55,781 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-27 04:26:55,804 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-27 04:26:56,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:56,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 33 conjunts are in the unsatisfiable core [2021-08-27 04:26:56,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 04:26:56,148 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 04:26:56,190 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 04:26:56,190 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-08-27 04:26:56,218 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-08-27 04:26:56,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 04:26:56,249 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-08-27 04:26:56,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 04:26:56,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 04:26:56,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 04:26:56,328 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-08-27 04:26:56,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 04:26:56,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 04:26:56,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 04:26:56,374 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2021-08-27 04:26:56,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 04:26:56,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 04:26:56,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 04:26:56,393 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2021-08-27 04:26:56,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 04:26:56,444 INFO L354 Elim1Store]: treesize reduction 74, result has 18.7 percent of original size [2021-08-27 04:26:56,444 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 27 [2021-08-27 04:26:56,606 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-27 04:26:56,607 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2021-08-27 04:26:56,621 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 78 proven. 13 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-08-27 04:26:56,621 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1144521747] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 04:26:56,621 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 04:26:56,621 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 23 [2021-08-27 04:26:56,621 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268063353] [2021-08-27 04:26:56,621 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-08-27 04:26:56,622 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:56,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-08-27 04:26:56,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2021-08-27 04:26:56,622 INFO L87 Difference]: Start difference. First operand 154 states and 175 transitions. Second operand has 23 states, 23 states have (on average 3.4782608695652173) internal successors, (80), 19 states have internal predecessors, (80), 1 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-27 04:26:57,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:57,272 INFO L93 Difference]: Finished difference Result 160 states and 179 transitions. [2021-08-27 04:26:57,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-08-27 04:26:57,273 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.4782608695652173) internal successors, (80), 19 states have internal predecessors, (80), 1 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 86 [2021-08-27 04:26:57,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:57,274 INFO L225 Difference]: With dead ends: 160 [2021-08-27 04:26:57,274 INFO L226 Difference]: Without dead ends: 160 [2021-08-27 04:26:57,274 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 85 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 453.9ms TimeCoverageRelationStatistics Valid=193, Invalid=1067, Unknown=0, NotChecked=0, Total=1260 [2021-08-27 04:26:57,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-08-27 04:26:57,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 154. [2021-08-27 04:26:57,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 134 states have (on average 1.2611940298507462) internal successors, (169), 148 states have internal predecessors, (169), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 04:26:57,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 174 transitions. [2021-08-27 04:26:57,277 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 174 transitions. Word has length 86 [2021-08-27 04:26:57,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:57,277 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 174 transitions. [2021-08-27 04:26:57,277 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.4782608695652173) internal successors, (80), 19 states have internal predecessors, (80), 1 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-27 04:26:57,277 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 174 transitions. [2021-08-27 04:26:57,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-27 04:26:57,278 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:57,278 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:57,297 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-27 04:26:57,491 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 04:26:57,491 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr21ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 30 more)] === [2021-08-27 04:26:57,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:57,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1467603535, now seen corresponding path program 1 times [2021-08-27 04:26:57,491 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:57,491 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910820522] [2021-08-27 04:26:57,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:57,492 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:57,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:57,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:57,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:57,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 04:26:57,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:57,781 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 74 proven. 11 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-08-27 04:26:57,781 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:57,781 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910820522] [2021-08-27 04:26:57,781 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910820522] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 04:26:57,781 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1626277667] [2021-08-27 04:26:57,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:57,782 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 04:26:57,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 04:26:57,785 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-27 04:26:57,824 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-27 04:26:58,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:58,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 31 conjunts are in the unsatisfiable core [2021-08-27 04:26:58,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 04:26:58,173 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 04:26:58,222 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 04:26:58,223 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-08-27 04:26:58,244 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-27 04:26:58,299 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-08-27 04:26:58,299 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2021-08-27 04:26:58,322 INFO L354 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2021-08-27 04:26:58,322 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 13 [2021-08-27 04:26:58,338 INFO L354 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2021-08-27 04:26:58,339 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 13 [2021-08-27 04:26:58,362 INFO L354 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2021-08-27 04:26:58,363 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 17 [2021-08-27 04:26:58,463 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-08-27 04:26:58,478 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 78 proven. 13 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-08-27 04:26:58,479 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1626277667] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 04:26:58,479 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 04:26:58,479 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 23 [2021-08-27 04:26:58,479 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576937942] [2021-08-27 04:26:58,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-08-27 04:26:58,480 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:58,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-08-27 04:26:58,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2021-08-27 04:26:58,481 INFO L87 Difference]: Start difference. First operand 154 states and 174 transitions. Second operand has 23 states, 23 states have (on average 3.6956521739130435) internal successors, (85), 19 states have internal predecessors, (85), 1 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-27 04:26:59,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:59,121 INFO L93 Difference]: Finished difference Result 160 states and 178 transitions. [2021-08-27 04:26:59,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-08-27 04:26:59,122 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.6956521739130435) internal successors, (85), 19 states have internal predecessors, (85), 1 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 88 [2021-08-27 04:26:59,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:59,122 INFO L225 Difference]: With dead ends: 160 [2021-08-27 04:26:59,123 INFO L226 Difference]: Without dead ends: 160 [2021-08-27 04:26:59,123 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 382.4ms TimeCoverageRelationStatistics Valid=163, Invalid=1027, Unknown=0, NotChecked=0, Total=1190 [2021-08-27 04:26:59,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-08-27 04:26:59,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 154. [2021-08-27 04:26:59,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 134 states have (on average 1.2537313432835822) internal successors, (168), 148 states have internal predecessors, (168), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 04:26:59,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 173 transitions. [2021-08-27 04:26:59,125 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 173 transitions. Word has length 88 [2021-08-27 04:26:59,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:59,126 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 173 transitions. [2021-08-27 04:26:59,126 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.6956521739130435) internal successors, (85), 19 states have internal predecessors, (85), 1 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-27 04:26:59,126 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 173 transitions. [2021-08-27 04:26:59,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-08-27 04:26:59,127 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:59,127 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:59,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-08-27 04:26:59,336 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 04:26:59,337 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr21ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 30 more)] === [2021-08-27 04:26:59,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:59,337 INFO L82 PathProgramCache]: Analyzing trace with hash -2087514772, now seen corresponding path program 1 times [2021-08-27 04:26:59,337 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:59,338 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675202739] [2021-08-27 04:26:59,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:59,338 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:59,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:59,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:59,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:59,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 04:26:59,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:59,601 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 74 proven. 11 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-08-27 04:26:59,601 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:59,601 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675202739] [2021-08-27 04:26:59,602 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675202739] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 04:26:59,602 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [909758735] [2021-08-27 04:26:59,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:59,602 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 04:26:59,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 04:26:59,603 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-27 04:26:59,604 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-27 04:26:59,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:59,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 32 conjunts are in the unsatisfiable core [2021-08-27 04:26:59,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 04:27:00,033 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 04:27:00,142 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 04:27:00,143 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-08-27 04:27:00,224 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-27 04:27:00,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 04:27:00,258 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-08-27 04:27:00,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 04:27:00,338 INFO L354 Elim1Store]: treesize reduction 68, result has 21.8 percent of original size [2021-08-27 04:27:00,338 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 42 [2021-08-27 04:27:00,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 04:27:00,624 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-27 04:27:00,632 INFO L354 Elim1Store]: treesize reduction 45, result has 6.3 percent of original size [2021-08-27 04:27:00,632 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 24 [2021-08-27 04:27:00,674 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 78 proven. 13 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-08-27 04:27:00,674 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [909758735] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 04:27:00,674 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 04:27:00,674 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 26 [2021-08-27 04:27:00,674 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862712195] [2021-08-27 04:27:00,675 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-08-27 04:27:00,675 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:27:00,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-08-27 04:27:00,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=591, Unknown=0, NotChecked=0, Total=650 [2021-08-27 04:27:00,675 INFO L87 Difference]: Start difference. First operand 154 states and 173 transitions. Second operand has 26 states, 26 states have (on average 3.769230769230769) internal successors, (98), 22 states have internal predecessors, (98), 1 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-27 04:27:01,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:27:01,544 INFO L93 Difference]: Finished difference Result 143 states and 157 transitions. [2021-08-27 04:27:01,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-08-27 04:27:01,545 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.769230769230769) internal successors, (98), 22 states have internal predecessors, (98), 1 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 89 [2021-08-27 04:27:01,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:27:01,545 INFO L225 Difference]: With dead ends: 143 [2021-08-27 04:27:01,545 INFO L226 Difference]: Without dead ends: 143 [2021-08-27 04:27:01,546 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 84 SyntacticMatches, 5 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 759.5ms TimeCoverageRelationStatistics Valid=218, Invalid=1422, Unknown=0, NotChecked=0, Total=1640 [2021-08-27 04:27:01,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-08-27 04:27:01,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 140. [2021-08-27 04:27:01,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 120 states have (on average 1.25) internal successors, (150), 134 states have internal predecessors, (150), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 04:27:01,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 155 transitions. [2021-08-27 04:27:01,548 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 155 transitions. Word has length 89 [2021-08-27 04:27:01,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:27:01,548 INFO L470 AbstractCegarLoop]: Abstraction has 140 states and 155 transitions. [2021-08-27 04:27:01,548 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.769230769230769) internal successors, (98), 22 states have internal predecessors, (98), 1 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-27 04:27:01,548 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 155 transitions. [2021-08-27 04:27:01,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-08-27 04:27:01,548 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:27:01,548 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:27:01,569 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-27 04:27:01,749 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,SelfDestructingSolverStorable14 [2021-08-27 04:27:01,749 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr21ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 30 more)] === [2021-08-27 04:27:01,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:27:01,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1619301044, now seen corresponding path program 1 times [2021-08-27 04:27:01,750 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:27:01,750 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285710709] [2021-08-27 04:27:01,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:27:01,750 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:27:01,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 04:27:01,789 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 04:27:01,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 04:27:01,862 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 04:27:01,862 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-27 04:27:01,863 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location mainErr21ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 04:27:01,864 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr0REQUIRES_VIOLATION [2021-08-27 04:27:01,865 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr1REQUIRES_VIOLATION [2021-08-27 04:27:01,865 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr2REQUIRES_VIOLATION [2021-08-27 04:27:01,865 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr3REQUIRES_VIOLATION [2021-08-27 04:27:01,865 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr4REQUIRES_VIOLATION [2021-08-27 04:27:01,865 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr5REQUIRES_VIOLATION [2021-08-27 04:27:01,865 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr6REQUIRES_VIOLATION [2021-08-27 04:27:01,865 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr7REQUIRES_VIOLATION [2021-08-27 04:27:01,865 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr8REQUIRES_VIOLATION [2021-08-27 04:27:01,866 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr9REQUIRES_VIOLATION [2021-08-27 04:27:01,866 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr10REQUIRES_VIOLATION [2021-08-27 04:27:01,866 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr11REQUIRES_VIOLATION [2021-08-27 04:27:01,866 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr12REQUIRES_VIOLATION [2021-08-27 04:27:01,866 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr13REQUIRES_VIOLATION [2021-08-27 04:27:01,866 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr14REQUIRES_VIOLATION [2021-08-27 04:27:01,866 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr15REQUIRES_VIOLATION [2021-08-27 04:27:01,867 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr16REQUIRES_VIOLATION [2021-08-27 04:27:01,867 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr17REQUIRES_VIOLATION [2021-08-27 04:27:01,867 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr18ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 04:27:01,867 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr19ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 04:27:01,867 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr20ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 04:27:01,867 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr22ENSURES_VIOLATIONMEMORY_LEAK [2021-08-27 04:27:01,867 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location dll_createErr0REQUIRES_VIOLATION [2021-08-27 04:27:01,867 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location dll_createErr1REQUIRES_VIOLATION [2021-08-27 04:27:01,868 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location dll_createErr2REQUIRES_VIOLATION [2021-08-27 04:27:01,868 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location dll_createErr3REQUIRES_VIOLATION [2021-08-27 04:27:01,868 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location dll_createErr4REQUIRES_VIOLATION [2021-08-27 04:27:01,868 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location dll_createErr5REQUIRES_VIOLATION [2021-08-27 04:27:01,868 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location dll_createErr6REQUIRES_VIOLATION [2021-08-27 04:27:01,868 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location dll_createErr7REQUIRES_VIOLATION [2021-08-27 04:27:01,868 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location dll_createErr8REQUIRES_VIOLATION [2021-08-27 04:27:01,868 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location dll_createErr9REQUIRES_VIOLATION [2021-08-27 04:27:01,868 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location dll_createErr10REQUIRES_VIOLATION [2021-08-27 04:27:01,869 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location dll_createErr11REQUIRES_VIOLATION [2021-08-27 04:27:01,869 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-27 04:27:01,875 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-27 04:27:01,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 04:27:01 BoogieIcfgContainer [2021-08-27 04:27:01,926 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-27 04:27:01,927 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 04:27:01,927 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 04:27:01,927 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 04:27:01,927 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 04:26:48" (3/4) ... [2021-08-27 04:27:01,928 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-08-27 04:27:01,977 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-27 04:27:01,977 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 04:27:01,978 INFO L168 Benchmark]: Toolchain (without parser) took 14603.82 ms. Allocated memory was 67.1 MB in the beginning and 243.3 MB in the end (delta: 176.2 MB). Free memory was 45.8 MB in the beginning and 200.1 MB in the end (delta: -154.3 MB). Peak memory consumption was 22.6 MB. Max. memory is 16.1 GB. [2021-08-27 04:27:01,978 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 67.1 MB. Free memory was 48.2 MB in the beginning and 48.1 MB in the end (delta: 39.7 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 04:27:01,978 INFO L168 Benchmark]: CACSL2BoogieTranslator took 263.16 ms. Allocated memory is still 67.1 MB. Free memory was 45.6 MB in the beginning and 42.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-08-27 04:27:01,978 INFO L168 Benchmark]: Boogie Preprocessor took 54.51 ms. Allocated memory is still 67.1 MB. Free memory was 42.7 MB in the beginning and 40.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-27 04:27:01,979 INFO L168 Benchmark]: RCFGBuilder took 652.38 ms. Allocated memory was 67.1 MB in the beginning and 94.4 MB in the end (delta: 27.3 MB). Free memory was 40.1 MB in the beginning and 49.9 MB in the end (delta: -9.9 MB). Peak memory consumption was 19.7 MB. Max. memory is 16.1 GB. [2021-08-27 04:27:01,979 INFO L168 Benchmark]: TraceAbstraction took 13579.04 ms. Allocated memory was 94.4 MB in the beginning and 243.3 MB in the end (delta: 148.9 MB). Free memory was 49.5 MB in the beginning and 205.3 MB in the end (delta: -155.9 MB). Peak memory consumption was 123.5 MB. Max. memory is 16.1 GB. [2021-08-27 04:27:01,979 INFO L168 Benchmark]: Witness Printer took 50.12 ms. Allocated memory is still 243.3 MB. Free memory was 205.3 MB in the beginning and 200.1 MB in the end (delta: 5.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-27 04:27:01,982 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.15 ms. Allocated memory is still 67.1 MB. Free memory was 48.2 MB in the beginning and 48.1 MB in the end (delta: 39.7 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 263.16 ms. Allocated memory is still 67.1 MB. Free memory was 45.6 MB in the beginning and 42.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 54.51 ms. Allocated memory is still 67.1 MB. Free memory was 42.7 MB in the beginning and 40.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 652.38 ms. Allocated memory was 67.1 MB in the beginning and 94.4 MB in the end (delta: 27.3 MB). Free memory was 40.1 MB in the beginning and 49.9 MB in the end (delta: -9.9 MB). Peak memory consumption was 19.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 13579.04 ms. Allocated memory was 94.4 MB in the beginning and 243.3 MB in the end (delta: 148.9 MB). Free memory was 49.5 MB in the beginning and 205.3 MB in the end (delta: -155.9 MB). Peak memory consumption was 123.5 MB. Max. memory is 16.1 GB. * Witness Printer took 50.12 ms. Allocated memory is still 243.3 MB. Free memory was 205.3 MB in the beginning and 200.1 MB in the end (delta: 5.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 616]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L599] const int len = 5; VAL [len=5] [L600] CALL, EXPR dll_create(len) VAL [\old(len)=5] [L579] DLL head = ((void *)0); VAL [\old(len)=5, head={0:0}, len=5] [L580] COND TRUE len > 0 [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); [L582] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={0:0}, len=5, new_head={-1:0}] [L585] new_head->data_0 = 0 VAL [\old(len)=5, head={0:0}, len=5, new_head={-1:0}] [L586] new_head->data_1 = 0 VAL [\old(len)=5, head={0:0}, len=5, new_head={-1:0}] [L587] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=5, __VERIFIER_nondet_int() == len? 1 : 0=1, head={0:0}, len=5, new_head={-1:0}] [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=5, __VERIFIER_nondet_int() == len? 1 : 0=1, head={0:0}, len=5, new_head={-1:0}] [L588] new_head->next = head VAL [\old(len)=5, head={0:0}, len=5, new_head={-1:0}] [L589] new_head->prev = ((void *)0) VAL [\old(len)=5, head={0:0}, len=5, new_head={-1:0}] [L590] COND FALSE !(\read(head)) VAL [\old(len)=5, head={0:0}, len=5, new_head={-1:0}] [L593] head = new_head [L594] len-- VAL [\old(len)=5, head={-1:0}, len=4, new_head={-1:0}] [L580] COND TRUE len > 0 [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); [L582] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={-1:0}, len=4, new_head={-2:0}] [L585] new_head->data_0 = 0 VAL [\old(len)=5, head={-1:0}, len=4, new_head={-2:0}] [L586] new_head->data_1 = 0 VAL [\old(len)=5, head={-1:0}, len=4, new_head={-2:0}] [L587] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=4, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-1:0}, len=4, new_head={-2:0}] [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=4, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-1:0}, len=4, new_head={-2:0}] [L588] new_head->next = head VAL [\old(len)=5, head={-1:0}, len=4, new_head={-2:0}] [L589] new_head->prev = ((void *)0) VAL [\old(len)=5, head={-1:0}, len=4, new_head={-2:0}] [L590] COND TRUE \read(head) VAL [\old(len)=5, head={-1:0}, len=4, new_head={-2:0}] [L591] head->prev = new_head VAL [\old(len)=5, head={-1:0}, len=4, new_head={-2:0}] [L593] head = new_head [L594] len-- VAL [\old(len)=5, head={-2:0}, len=3, new_head={-2:0}] [L580] COND TRUE len > 0 [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); [L582] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={-2:0}, len=3, new_head={-3:0}] [L585] new_head->data_0 = 0 VAL [\old(len)=5, head={-2:0}, len=3, new_head={-3:0}] [L586] new_head->data_1 = 0 VAL [\old(len)=5, head={-2:0}, len=3, new_head={-3:0}] [L587] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=3, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-2:0}, len=3, new_head={-3:0}] [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=3, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-2:0}, len=3, new_head={-3:0}] [L588] new_head->next = head VAL [\old(len)=5, head={-2:0}, len=3, new_head={-3:0}] [L589] new_head->prev = ((void *)0) VAL [\old(len)=5, head={-2:0}, len=3, new_head={-3:0}] [L590] COND TRUE \read(head) VAL [\old(len)=5, head={-2:0}, len=3, new_head={-3:0}] [L591] head->prev = new_head VAL [\old(len)=5, head={-2:0}, len=3, new_head={-3:0}] [L593] head = new_head [L594] len-- VAL [\old(len)=5, head={-3:0}, len=2, new_head={-3:0}] [L580] COND TRUE len > 0 [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); [L582] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={-3:0}, len=2, new_head={-4:0}] [L585] new_head->data_0 = 0 VAL [\old(len)=5, head={-3:0}, len=2, new_head={-4:0}] [L586] new_head->data_1 = 0 VAL [\old(len)=5, head={-3:0}, len=2, new_head={-4:0}] [L587] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=2, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-3:0}, len=2, new_head={-4:0}] [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=2, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-3:0}, len=2, new_head={-4:0}] [L588] new_head->next = head VAL [\old(len)=5, head={-3:0}, len=2, new_head={-4:0}] [L589] new_head->prev = ((void *)0) VAL [\old(len)=5, head={-3:0}, len=2, new_head={-4:0}] [L590] COND TRUE \read(head) VAL [\old(len)=5, head={-3:0}, len=2, new_head={-4:0}] [L591] head->prev = new_head VAL [\old(len)=5, head={-3:0}, len=2, new_head={-4:0}] [L593] head = new_head [L594] len-- VAL [\old(len)=5, head={-4:0}, len=1, new_head={-4:0}] [L580] COND TRUE len > 0 [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); [L582] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={-4:0}, len=1, new_head={-5:0}] [L585] new_head->data_0 = 0 VAL [\old(len)=5, head={-4:0}, len=1, new_head={-5:0}] [L586] new_head->data_1 = 0 VAL [\old(len)=5, head={-4:0}, len=1, new_head={-5:0}] [L587] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=1, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-4:0}, len=1, new_head={-5:0}] [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=1, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-4:0}, len=1, new_head={-5:0}] [L588] new_head->next = head VAL [\old(len)=5, head={-4:0}, len=1, new_head={-5:0}] [L589] new_head->prev = ((void *)0) VAL [\old(len)=5, head={-4:0}, len=1, new_head={-5:0}] [L590] COND TRUE \read(head) VAL [\old(len)=5, head={-4:0}, len=1, new_head={-5:0}] [L591] head->prev = new_head VAL [\old(len)=5, head={-4:0}, len=1, new_head={-5:0}] [L593] head = new_head [L594] len-- VAL [\old(len)=5, head={-5:0}, len=0, new_head={-5:0}] [L580] COND FALSE !(len > 0) VAL [\old(len)=5, head={-5:0}, len=0, new_head={-5:0}] [L596] return head; VAL [\old(len)=5, \result={-5:0}, head={-5:0}, len=0, new_head={-5:0}] [L600] RET, EXPR dll_create(len) VAL [dll_create(len)={-5:0}, len=5] [L600] DLL head = dll_create(len); [L601] head->next VAL [head={-5:0}, head->next={-4:0}, len=5] [L601] COND TRUE head->next [L602] EXPR head->data_0 VAL [head={-5:0}, head->data_0=0, len=5] [L602] EXPR 0 != head->data_0 || 0 != head->data_1 VAL [0 != head->data_0 || 0 != head->data_1=0, head={-5:0}, head->data_0=0, len=5] [L602] EXPR head->data_1 VAL [0 != head->data_0 || 0 != head->data_1=0, head={-5:0}, head->data_0=0, head->data_1=0, len=5] [L602] EXPR 0 != head->data_0 || 0 != head->data_1 VAL [0 != head->data_0 || 0 != head->data_1=0, head={-5:0}, head->data_0=0, head->data_1=0, len=5] [L602] 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 VAL [0 != head->data_0 || 0 != head->data_1=0, 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2=0, head={-5:0}, head->data_0=0, head->data_1=0, len=5] [L602] EXPR head->data_2 VAL [0 != head->data_0 || 0 != head->data_1=0, 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2=0, head={-5:0}, head->data_0=0, head->data_1=0, head->data_2=1, len=5] [L602] 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 VAL [0 != head->data_0 || 0 != head->data_1=0, 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2=1, head={-5:0}, head->data_0=0, head->data_1=0, head->data_2=1, len=5] [L602] COND TRUE 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 [L616] reach_error() VAL [head={-5:0}, len=5] - 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 pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: 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 pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: 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 pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 605]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 605]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 608]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 608]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 609]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 609]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 609]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 609]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 609]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 609]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 612]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 612]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 612]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 598]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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: 587]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 587]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 588]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 588]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 591]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 591]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 109 locations, 35 error locations. Started 1 CEGAR loops. OverallTime: 13496.3ms, OverallIterations: 16, TraceHistogramMax: 5, EmptinessCheckTime: 22.4ms, AutomataDifference: 4805.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 11.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1017 SDtfs, 1327 SDslu, 5277 SDs, 0 SdLazy, 5271 SolverSat, 243 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2575.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 727 GetRequests, 501 SyntacticMatches, 11 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 2602.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=154occurred in iteration=11, InterpolantAutomatonStates: 151, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 69.7ms AutomataMinimizationTime, 15 MinimizatonAttempts, 176 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 158.3ms SsaConstructionTime, 504.5ms SatisfiabilityAnalysisTime, 4629.4ms InterpolantComputationTime, 1284 NumberOfCodeBlocks, 1284 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1171 ConstructedInterpolants, 18 QuantifiedInterpolants, 5611 SizeOfPredicates, 41 NumberOfNonLiveVariables, 2618 ConjunctsInSsa, 134 ConjunctsInUnsatCore, 23 InterpolantComputations, 7 PerfectInterpolantSequences, 983/1339 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-08-27 04:27:02,019 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...