./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/forester-heap/dll-circular-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version e943c265 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d4c591a-4fea-4475-9529-c72f4b00fe13/bin/uautomizer-j4sWxH34Be/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d4c591a-4fea-4475-9529-c72f4b00fe13/bin/uautomizer-j4sWxH34Be/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d4c591a-4fea-4475-9529-c72f4b00fe13/bin/uautomizer-j4sWxH34Be/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d4c591a-4fea-4475-9529-c72f4b00fe13/bin/uautomizer-j4sWxH34Be/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-circular-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d4c591a-4fea-4475-9529-c72f4b00fe13/bin/uautomizer-j4sWxH34Be/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d4c591a-4fea-4475-9529-c72f4b00fe13/bin/uautomizer-j4sWxH34Be --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 4b74df92940ca0e86c8c02c3eca1e89fb6c9c9c1248a25cd764acf39f7727180 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-e943c26 [2021-10-21 20:25:13,715 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-21 20:25:13,718 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-21 20:25:13,748 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-21 20:25:13,749 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-21 20:25:13,751 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-21 20:25:13,753 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-21 20:25:13,755 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-21 20:25:13,757 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-21 20:25:13,759 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-21 20:25:13,760 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-21 20:25:13,762 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-21 20:25:13,763 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-21 20:25:13,764 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-21 20:25:13,766 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-21 20:25:13,768 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-21 20:25:13,769 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-21 20:25:13,771 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-21 20:25:13,773 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-21 20:25:13,776 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-21 20:25:13,778 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-21 20:25:13,780 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-21 20:25:13,781 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-21 20:25:13,783 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-21 20:25:13,786 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-21 20:25:13,787 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-21 20:25:13,787 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-21 20:25:13,789 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-21 20:25:13,789 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-21 20:25:13,791 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-21 20:25:13,791 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-21 20:25:13,792 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-21 20:25:13,793 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-21 20:25:13,795 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-21 20:25:13,796 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-21 20:25:13,796 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-21 20:25:13,797 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-21 20:25:13,798 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-21 20:25:13,798 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-21 20:25:13,799 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-21 20:25:13,800 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-21 20:25:13,801 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d4c591a-4fea-4475-9529-c72f4b00fe13/bin/uautomizer-j4sWxH34Be/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2021-10-21 20:25:13,829 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-21 20:25:13,834 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-21 20:25:13,835 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-21 20:25:13,835 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-21 20:25:13,837 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-21 20:25:13,838 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-21 20:25:13,838 INFO L138 SettingsManager]: * Use SBE=true [2021-10-21 20:25:13,838 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-21 20:25:13,839 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-21 20:25:13,839 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-21 20:25:13,840 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-21 20:25:13,840 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-21 20:25:13,840 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-21 20:25:13,841 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-10-21 20:25:13,841 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-10-21 20:25:13,841 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-21 20:25:13,841 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-21 20:25:13,842 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-21 20:25:13,842 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-21 20:25:13,842 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-21 20:25:13,842 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-21 20:25:13,842 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-21 20:25:13,843 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-21 20:25:13,843 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-21 20:25:13,843 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-21 20:25:13,843 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-21 20:25:13,844 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-21 20:25:13,844 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-21 20:25:13,844 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d4c591a-4fea-4475-9529-c72f4b00fe13/bin/uautomizer-j4sWxH34Be/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d4c591a-4fea-4475-9529-c72f4b00fe13/bin/uautomizer-j4sWxH34Be 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 -> 4b74df92940ca0e86c8c02c3eca1e89fb6c9c9c1248a25cd764acf39f7727180 [2021-10-21 20:25:14,121 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-21 20:25:14,147 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-21 20:25:14,150 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-21 20:25:14,151 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-21 20:25:14,152 INFO L275 PluginConnector]: CDTParser initialized [2021-10-21 20:25:14,153 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d4c591a-4fea-4475-9529-c72f4b00fe13/bin/uautomizer-j4sWxH34Be/../../sv-benchmarks/c/forester-heap/dll-circular-1.i [2021-10-21 20:25:14,224 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d4c591a-4fea-4475-9529-c72f4b00fe13/bin/uautomizer-j4sWxH34Be/data/a926216b2/64807605a1194a8dae3d2532d824fed6/FLAG5020d879a [2021-10-21 20:25:14,806 INFO L306 CDTParser]: Found 1 translation units. [2021-10-21 20:25:14,807 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d4c591a-4fea-4475-9529-c72f4b00fe13/sv-benchmarks/c/forester-heap/dll-circular-1.i [2021-10-21 20:25:14,823 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d4c591a-4fea-4475-9529-c72f4b00fe13/bin/uautomizer-j4sWxH34Be/data/a926216b2/64807605a1194a8dae3d2532d824fed6/FLAG5020d879a [2021-10-21 20:25:15,088 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d4c591a-4fea-4475-9529-c72f4b00fe13/bin/uautomizer-j4sWxH34Be/data/a926216b2/64807605a1194a8dae3d2532d824fed6 [2021-10-21 20:25:15,090 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-21 20:25:15,092 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-10-21 20:25:15,093 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-21 20:25:15,094 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-21 20:25:15,115 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-21 20:25:15,115 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 08:25:15" (1/1) ... [2021-10-21 20:25:15,117 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@199f345 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:25:15, skipping insertion in model container [2021-10-21 20:25:15,117 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 08:25:15" (1/1) ... [2021-10-21 20:25:15,126 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-21 20:25:15,202 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-21 20:25:15,579 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d4c591a-4fea-4475-9529-c72f4b00fe13/sv-benchmarks/c/forester-heap/dll-circular-1.i[22365,22378] [2021-10-21 20:25:15,587 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d4c591a-4fea-4475-9529-c72f4b00fe13/sv-benchmarks/c/forester-heap/dll-circular-1.i[22471,22484] [2021-10-21 20:25:15,591 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d4c591a-4fea-4475-9529-c72f4b00fe13/sv-benchmarks/c/forester-heap/dll-circular-1.i[22595,22608] [2021-10-21 20:25:15,602 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-21 20:25:15,617 INFO L203 MainTranslator]: Completed pre-run [2021-10-21 20:25:15,677 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d4c591a-4fea-4475-9529-c72f4b00fe13/sv-benchmarks/c/forester-heap/dll-circular-1.i[22365,22378] [2021-10-21 20:25:15,678 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d4c591a-4fea-4475-9529-c72f4b00fe13/sv-benchmarks/c/forester-heap/dll-circular-1.i[22471,22484] [2021-10-21 20:25:15,680 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d4c591a-4fea-4475-9529-c72f4b00fe13/sv-benchmarks/c/forester-heap/dll-circular-1.i[22595,22608] [2021-10-21 20:25:15,682 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-21 20:25:15,721 INFO L208 MainTranslator]: Completed translation [2021-10-21 20:25:15,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:25:15 WrapperNode [2021-10-21 20:25:15,722 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-21 20:25:15,723 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-21 20:25:15,723 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-21 20:25:15,724 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-21 20:25:15,736 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:25:15" (1/1) ... [2021-10-21 20:25:15,736 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:25:15" (1/1) ... [2021-10-21 20:25:15,751 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:25:15" (1/1) ... [2021-10-21 20:25:15,751 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:25:15" (1/1) ... [2021-10-21 20:25:15,770 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:25:15" (1/1) ... [2021-10-21 20:25:15,776 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:25:15" (1/1) ... [2021-10-21 20:25:15,779 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:25:15" (1/1) ... [2021-10-21 20:25:15,790 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-21 20:25:15,791 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-21 20:25:15,791 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-21 20:25:15,792 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-21 20:25:15,805 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:25:15" (1/1) ... [2021-10-21 20:25:15,816 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-21 20:25:15,828 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d4c591a-4fea-4475-9529-c72f4b00fe13/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 20:25:15,850 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d4c591a-4fea-4475-9529-c72f4b00fe13/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-21 20:25:15,884 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d4c591a-4fea-4475-9529-c72f4b00fe13/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-21 20:25:15,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-10-21 20:25:15,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-21 20:25:15,909 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-10-21 20:25:15,909 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-10-21 20:25:15,909 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2021-10-21 20:25:15,909 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2021-10-21 20:25:15,912 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2021-10-21 20:25:15,912 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2021-10-21 20:25:15,912 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2021-10-21 20:25:15,912 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2021-10-21 20:25:15,912 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2021-10-21 20:25:15,912 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2021-10-21 20:25:15,912 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2021-10-21 20:25:15,913 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2021-10-21 20:25:15,913 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2021-10-21 20:25:15,913 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2021-10-21 20:25:15,913 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2021-10-21 20:25:15,913 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2021-10-21 20:25:15,913 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2021-10-21 20:25:15,913 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2021-10-21 20:25:15,913 INFO L130 BoogieDeclarations]: Found specification of procedure select [2021-10-21 20:25:15,914 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2021-10-21 20:25:15,914 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2021-10-21 20:25:15,914 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2021-10-21 20:25:15,914 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2021-10-21 20:25:15,914 INFO L130 BoogieDeclarations]: Found specification of procedure random [2021-10-21 20:25:15,914 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2021-10-21 20:25:15,914 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2021-10-21 20:25:15,915 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2021-10-21 20:25:15,915 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2021-10-21 20:25:15,915 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2021-10-21 20:25:15,915 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2021-10-21 20:25:15,915 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2021-10-21 20:25:15,915 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2021-10-21 20:25:15,915 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2021-10-21 20:25:15,915 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2021-10-21 20:25:15,916 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2021-10-21 20:25:15,916 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2021-10-21 20:25:15,916 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2021-10-21 20:25:15,916 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2021-10-21 20:25:15,916 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2021-10-21 20:25:15,916 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2021-10-21 20:25:15,916 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2021-10-21 20:25:15,916 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2021-10-21 20:25:15,917 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2021-10-21 20:25:15,917 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2021-10-21 20:25:15,918 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2021-10-21 20:25:15,918 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2021-10-21 20:25:15,918 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2021-10-21 20:25:15,918 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2021-10-21 20:25:15,918 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2021-10-21 20:25:15,919 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2021-10-21 20:25:15,919 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2021-10-21 20:25:15,919 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2021-10-21 20:25:15,919 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-10-21 20:25:15,919 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-10-21 20:25:15,919 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2021-10-21 20:25:15,919 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-10-21 20:25:15,919 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2021-10-21 20:25:15,920 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2021-10-21 20:25:15,920 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2021-10-21 20:25:15,921 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2021-10-21 20:25:15,921 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2021-10-21 20:25:15,922 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-10-21 20:25:15,922 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2021-10-21 20:25:15,923 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2021-10-21 20:25:15,923 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2021-10-21 20:25:15,923 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2021-10-21 20:25:15,923 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2021-10-21 20:25:15,923 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2021-10-21 20:25:15,923 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2021-10-21 20:25:15,924 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2021-10-21 20:25:15,924 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2021-10-21 20:25:15,924 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2021-10-21 20:25:15,924 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2021-10-21 20:25:15,925 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2021-10-21 20:25:15,925 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2021-10-21 20:25:15,925 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2021-10-21 20:25:15,925 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2021-10-21 20:25:15,925 INFO L130 BoogieDeclarations]: Found specification of procedure system [2021-10-21 20:25:15,925 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2021-10-21 20:25:15,925 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2021-10-21 20:25:15,926 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2021-10-21 20:25:15,926 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2021-10-21 20:25:15,926 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2021-10-21 20:25:15,926 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2021-10-21 20:25:15,926 INFO L130 BoogieDeclarations]: Found specification of procedure div [2021-10-21 20:25:15,926 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2021-10-21 20:25:15,926 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2021-10-21 20:25:15,926 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2021-10-21 20:25:15,926 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2021-10-21 20:25:15,927 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2021-10-21 20:25:15,927 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2021-10-21 20:25:15,927 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2021-10-21 20:25:15,927 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2021-10-21 20:25:15,927 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2021-10-21 20:25:15,927 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2021-10-21 20:25:15,927 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2021-10-21 20:25:15,927 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2021-10-21 20:25:15,928 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2021-10-21 20:25:15,928 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2021-10-21 20:25:15,928 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2021-10-21 20:25:15,928 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2021-10-21 20:25:15,928 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2021-10-21 20:25:15,928 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2021-10-21 20:25:15,929 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2021-10-21 20:25:15,929 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2021-10-21 20:25:15,929 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-10-21 20:25:15,929 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-10-21 20:25:15,929 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-10-21 20:25:15,929 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-10-21 20:25:15,929 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-10-21 20:25:15,930 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-21 20:25:15,930 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-10-21 20:25:15,930 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-10-21 20:25:15,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-10-21 20:25:15,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-21 20:25:15,930 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-10-21 20:25:15,930 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-21 20:25:15,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-21 20:25:15,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-10-21 20:25:15,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-21 20:25:15,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-21 20:25:16,538 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-21 20:25:16,538 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2021-10-21 20:25:16,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 08:25:16 BoogieIcfgContainer [2021-10-21 20:25:16,540 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-21 20:25:16,542 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-21 20:25:16,542 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-21 20:25:16,546 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-21 20:25:16,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.10 08:25:15" (1/3) ... [2021-10-21 20:25:16,547 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7055cfe9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 08:25:16, skipping insertion in model container [2021-10-21 20:25:16,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:25:15" (2/3) ... [2021-10-21 20:25:16,547 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7055cfe9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 08:25:16, skipping insertion in model container [2021-10-21 20:25:16,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 08:25:16" (3/3) ... [2021-10-21 20:25:16,549 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-circular-1.i [2021-10-21 20:25:16,554 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-21 20:25:16,555 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 50 error locations. [2021-10-21 20:25:16,617 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-21 20:25:16,650 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, mAutomataTypeConcurrency=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-10-21 20:25:16,650 INFO L340 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2021-10-21 20:25:16,672 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 59 states have (on average 2.169491525423729) internal successors, (128), 109 states have internal predecessors, (128), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-10-21 20:25:16,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-21 20:25:16,680 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:25:16,681 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:25:16,682 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 45 more)] === [2021-10-21 20:25:16,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:25:16,688 INFO L82 PathProgramCache]: Analyzing trace with hash 241838902, now seen corresponding path program 1 times [2021-10-21 20:25:16,708 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:25:16,709 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172169192] [2021-10-21 20:25:16,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:25:16,710 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:25:16,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:25:16,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 20:25:16,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:25:17,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:25:17,006 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:25:17,006 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172169192] [2021-10-21 20:25:17,007 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172169192] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:25:17,008 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:25:17,008 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 20:25:17,010 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801263352] [2021-10-21 20:25:17,028 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 20:25:17,029 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:25:17,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 20:25:17,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 20:25:17,048 INFO L87 Difference]: Start difference. First operand has 114 states, 59 states have (on average 2.169491525423729) internal successors, (128), 109 states have internal predecessors, (128), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 20:25:17,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:25:17,371 INFO L93 Difference]: Finished difference Result 120 states and 127 transitions. [2021-10-21 20:25:17,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-21 20:25:17,374 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 7 [2021-10-21 20:25:17,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:25:17,384 INFO L225 Difference]: With dead ends: 120 [2021-10-21 20:25:17,384 INFO L226 Difference]: Without dead ends: 117 [2021-10-21 20:25:17,386 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 35.7ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 20:25:17,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-10-21 20:25:17,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 107. [2021-10-21 20:25:17,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 58 states have (on average 1.896551724137931) internal successors, (110), 103 states have internal predecessors, (110), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 20:25:17,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2021-10-21 20:25:17,440 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 7 [2021-10-21 20:25:17,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:25:17,441 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2021-10-21 20:25:17,441 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 20:25:17,441 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2021-10-21 20:25:17,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-21 20:25:17,442 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:25:17,442 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:25:17,442 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-21 20:25:17,443 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr1REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 45 more)] === [2021-10-21 20:25:17,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:25:17,444 INFO L82 PathProgramCache]: Analyzing trace with hash 241838903, now seen corresponding path program 1 times [2021-10-21 20:25:17,444 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:25:17,445 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371264994] [2021-10-21 20:25:17,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:25:17,446 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:25:17,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:25:17,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 20:25:17,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:25:17,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:25:17,586 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:25:17,586 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371264994] [2021-10-21 20:25:17,587 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371264994] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:25:17,587 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:25:17,587 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 20:25:17,587 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265341658] [2021-10-21 20:25:17,588 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 20:25:17,590 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:25:17,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 20:25:17,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 20:25:17,595 INFO L87 Difference]: Start difference. First operand 107 states and 113 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 20:25:17,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:25:17,841 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2021-10-21 20:25:17,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-21 20:25:17,842 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 7 [2021-10-21 20:25:17,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:25:17,847 INFO L225 Difference]: With dead ends: 115 [2021-10-21 20:25:17,847 INFO L226 Difference]: Without dead ends: 115 [2021-10-21 20:25:17,849 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 21.3ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 20:25:17,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-10-21 20:25:17,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 103. [2021-10-21 20:25:17,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 58 states have (on average 1.8275862068965518) internal successors, (106), 99 states have internal predecessors, (106), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 20:25:17,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 109 transitions. [2021-10-21 20:25:17,870 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 109 transitions. Word has length 7 [2021-10-21 20:25:17,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:25:17,870 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 109 transitions. [2021-10-21 20:25:17,871 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 20:25:17,871 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 109 transitions. [2021-10-21 20:25:17,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-10-21 20:25:17,872 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:25:17,872 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:25:17,873 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-21 20:25:17,873 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr17REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 45 more)] === [2021-10-21 20:25:17,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:25:17,874 INFO L82 PathProgramCache]: Analyzing trace with hash 526931837, now seen corresponding path program 1 times [2021-10-21 20:25:17,875 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:25:17,875 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223728122] [2021-10-21 20:25:17,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:25:17,876 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:25:17,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:25:18,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 20:25:18,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:25:18,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:25:18,046 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:25:18,046 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223728122] [2021-10-21 20:25:18,046 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223728122] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:25:18,047 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:25:18,047 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-21 20:25:18,047 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575180542] [2021-10-21 20:25:18,047 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-21 20:25:18,047 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:25:18,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-21 20:25:18,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-21 20:25:18,048 INFO L87 Difference]: Start difference. First operand 103 states and 109 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 20:25:18,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:25:18,309 INFO L93 Difference]: Finished difference Result 100 states and 107 transitions. [2021-10-21 20:25:18,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-21 20:25:18,309 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2021-10-21 20:25:18,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:25:18,315 INFO L225 Difference]: With dead ends: 100 [2021-10-21 20:25:18,315 INFO L226 Difference]: Without dead ends: 100 [2021-10-21 20:25:18,315 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 40.1ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-21 20:25:18,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-10-21 20:25:18,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 91. [2021-10-21 20:25:18,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 58 states have (on average 1.6206896551724137) internal successors, (94), 87 states have internal predecessors, (94), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 20:25:18,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 97 transitions. [2021-10-21 20:25:18,333 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 97 transitions. Word has length 12 [2021-10-21 20:25:18,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:25:18,333 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 97 transitions. [2021-10-21 20:25:18,333 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 20:25:18,334 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 97 transitions. [2021-10-21 20:25:18,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-10-21 20:25:18,334 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:25:18,334 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:25:18,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-21 20:25:18,335 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr18REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 45 more)] === [2021-10-21 20:25:18,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:25:18,336 INFO L82 PathProgramCache]: Analyzing trace with hash 526931838, now seen corresponding path program 1 times [2021-10-21 20:25:18,336 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:25:18,337 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536091234] [2021-10-21 20:25:18,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:25:18,337 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:25:18,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:25:18,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 20:25:18,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:25:18,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:25:18,466 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:25:18,466 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536091234] [2021-10-21 20:25:18,466 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536091234] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:25:18,466 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:25:18,467 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-21 20:25:18,467 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024145732] [2021-10-21 20:25:18,468 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-21 20:25:18,469 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:25:18,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-21 20:25:18,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-21 20:25:18,469 INFO L87 Difference]: Start difference. First operand 91 states and 97 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 20:25:18,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:25:18,700 INFO L93 Difference]: Finished difference Result 116 states and 123 transitions. [2021-10-21 20:25:18,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-21 20:25:18,701 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2021-10-21 20:25:18,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:25:18,702 INFO L225 Difference]: With dead ends: 116 [2021-10-21 20:25:18,702 INFO L226 Difference]: Without dead ends: 116 [2021-10-21 20:25:18,703 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 39.5ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-21 20:25:18,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-10-21 20:25:18,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 100. [2021-10-21 20:25:18,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 67 states have (on average 1.5820895522388059) internal successors, (106), 96 states have internal predecessors, (106), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 20:25:18,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 109 transitions. [2021-10-21 20:25:18,721 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 109 transitions. Word has length 12 [2021-10-21 20:25:18,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:25:18,721 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 109 transitions. [2021-10-21 20:25:18,722 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 20:25:18,722 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 109 transitions. [2021-10-21 20:25:18,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-21 20:25:18,723 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:25:18,723 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:25:18,723 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-21 20:25:18,723 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr8REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 45 more)] === [2021-10-21 20:25:18,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:25:18,724 INFO L82 PathProgramCache]: Analyzing trace with hash -279051196, now seen corresponding path program 1 times [2021-10-21 20:25:18,724 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:25:18,724 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509674725] [2021-10-21 20:25:18,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:25:18,724 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:25:18,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:25:18,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 20:25:18,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:25:18,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:25:18,820 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:25:18,820 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509674725] [2021-10-21 20:25:18,820 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509674725] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:25:18,820 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:25:18,820 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-21 20:25:18,821 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591759809] [2021-10-21 20:25:18,821 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-21 20:25:18,821 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:25:18,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-21 20:25:18,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-21 20:25:18,822 INFO L87 Difference]: Start difference. First operand 100 states and 109 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 20:25:19,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:25:19,011 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2021-10-21 20:25:19,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-21 20:25:19,012 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2021-10-21 20:25:19,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:25:19,013 INFO L225 Difference]: With dead ends: 99 [2021-10-21 20:25:19,013 INFO L226 Difference]: Without dead ends: 99 [2021-10-21 20:25:19,013 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 38.8ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-10-21 20:25:19,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-10-21 20:25:19,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2021-10-21 20:25:19,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 67 states have (on average 1.5522388059701493) internal successors, (104), 95 states have internal predecessors, (104), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 20:25:19,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2021-10-21 20:25:19,020 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 15 [2021-10-21 20:25:19,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:25:19,021 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2021-10-21 20:25:19,021 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 20:25:19,021 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2021-10-21 20:25:19,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-21 20:25:19,022 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:25:19,022 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:25:19,022 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-21 20:25:19,023 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr9REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 45 more)] === [2021-10-21 20:25:19,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:25:19,023 INFO L82 PathProgramCache]: Analyzing trace with hash -279051195, now seen corresponding path program 1 times [2021-10-21 20:25:19,023 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:25:19,024 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389943837] [2021-10-21 20:25:19,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:25:19,024 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:25:19,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:25:19,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 20:25:19,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:25:19,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:25:19,171 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:25:19,171 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389943837] [2021-10-21 20:25:19,171 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389943837] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:25:19,171 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:25:19,171 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-21 20:25:19,171 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020880355] [2021-10-21 20:25:19,172 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-21 20:25:19,172 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:25:19,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-21 20:25:19,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-21 20:25:19,175 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 20:25:19,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:25:19,382 INFO L93 Difference]: Finished difference Result 98 states and 105 transitions. [2021-10-21 20:25:19,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-21 20:25:19,383 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2021-10-21 20:25:19,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:25:19,384 INFO L225 Difference]: With dead ends: 98 [2021-10-21 20:25:19,384 INFO L226 Difference]: Without dead ends: 98 [2021-10-21 20:25:19,385 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 64.0ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-10-21 20:25:19,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-10-21 20:25:19,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2021-10-21 20:25:19,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 67 states have (on average 1.5223880597014925) internal successors, (102), 94 states have internal predecessors, (102), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 20:25:19,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2021-10-21 20:25:19,402 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 15 [2021-10-21 20:25:19,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:25:19,402 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2021-10-21 20:25:19,403 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 20:25:19,403 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2021-10-21 20:25:19,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-21 20:25:19,404 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:25:19,404 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:25:19,405 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-21 20:25:19,408 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr21ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 45 more)] === [2021-10-21 20:25:19,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:25:19,409 INFO L82 PathProgramCache]: Analyzing trace with hash -60650400, now seen corresponding path program 1 times [2021-10-21 20:25:19,409 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:25:19,410 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102037688] [2021-10-21 20:25:19,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:25:19,410 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:25:19,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:25:19,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 20:25:19,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:25:19,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:25:19,609 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:25:19,609 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102037688] [2021-10-21 20:25:19,610 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102037688] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:25:19,610 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:25:19,610 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-21 20:25:19,611 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626434321] [2021-10-21 20:25:19,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-21 20:25:19,612 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:25:19,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-21 20:25:19,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-10-21 20:25:19,613 INFO L87 Difference]: Start difference. First operand 98 states and 105 transitions. Second operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 20:25:19,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:25:19,909 INFO L93 Difference]: Finished difference Result 181 states and 192 transitions. [2021-10-21 20:25:19,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-21 20:25:19,910 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2021-10-21 20:25:19,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:25:19,911 INFO L225 Difference]: With dead ends: 181 [2021-10-21 20:25:19,911 INFO L226 Difference]: Without dead ends: 181 [2021-10-21 20:25:19,912 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 122.8ms TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2021-10-21 20:25:19,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2021-10-21 20:25:19,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 101. [2021-10-21 20:25:19,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 70 states have (on average 1.5) internal successors, (105), 97 states have internal predecessors, (105), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 20:25:19,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 108 transitions. [2021-10-21 20:25:19,920 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 108 transitions. Word has length 16 [2021-10-21 20:25:19,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:25:19,921 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 108 transitions. [2021-10-21 20:25:19,921 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 20:25:19,921 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 108 transitions. [2021-10-21 20:25:19,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-21 20:25:19,923 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:25:19,923 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:25:19,923 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-21 20:25:19,923 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr22REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 45 more)] === [2021-10-21 20:25:19,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:25:19,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1880158223, now seen corresponding path program 1 times [2021-10-21 20:25:19,924 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:25:19,928 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14060873] [2021-10-21 20:25:19,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:25:19,928 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:25:19,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:25:20,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 20:25:20,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:25:20,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:25:20,115 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:25:20,115 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14060873] [2021-10-21 20:25:20,116 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14060873] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:25:20,116 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:25:20,116 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-21 20:25:20,116 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715994357] [2021-10-21 20:25:20,116 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-21 20:25:20,117 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:25:20,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-21 20:25:20,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-10-21 20:25:20,117 INFO L87 Difference]: Start difference. First operand 101 states and 108 transitions. Second operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 20:25:20,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:25:20,477 INFO L93 Difference]: Finished difference Result 143 states and 152 transitions. [2021-10-21 20:25:20,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-21 20:25:20,478 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2021-10-21 20:25:20,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:25:20,479 INFO L225 Difference]: With dead ends: 143 [2021-10-21 20:25:20,479 INFO L226 Difference]: Without dead ends: 143 [2021-10-21 20:25:20,480 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 138.0ms TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2021-10-21 20:25:20,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-10-21 20:25:20,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 103. [2021-10-21 20:25:20,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 72 states have (on average 1.5) internal successors, (108), 99 states have internal predecessors, (108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 20:25:20,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2021-10-21 20:25:20,483 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 17 [2021-10-21 20:25:20,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:25:20,483 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2021-10-21 20:25:20,483 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 20:25:20,484 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2021-10-21 20:25:20,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-21 20:25:20,484 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:25:20,485 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:25:20,485 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-21 20:25:20,485 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr23REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 45 more)] === [2021-10-21 20:25:20,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:25:20,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1880158222, now seen corresponding path program 1 times [2021-10-21 20:25:20,486 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:25:20,486 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718712653] [2021-10-21 20:25:20,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:25:20,487 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:25:20,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:25:20,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 20:25:20,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:25:20,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:25:20,730 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:25:20,730 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718712653] [2021-10-21 20:25:20,730 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718712653] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:25:20,730 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:25:20,730 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-21 20:25:20,731 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864889917] [2021-10-21 20:25:20,731 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-21 20:25:20,731 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:25:20,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-21 20:25:20,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-10-21 20:25:20,732 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 20:25:21,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:25:21,166 INFO L93 Difference]: Finished difference Result 175 states and 186 transitions. [2021-10-21 20:25:21,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-21 20:25:21,167 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2021-10-21 20:25:21,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:25:21,168 INFO L225 Difference]: With dead ends: 175 [2021-10-21 20:25:21,169 INFO L226 Difference]: Without dead ends: 175 [2021-10-21 20:25:21,169 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 203.1ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-10-21 20:25:21,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2021-10-21 20:25:21,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 115. [2021-10-21 20:25:21,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 84 states have (on average 1.5) internal successors, (126), 111 states have internal predecessors, (126), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 20:25:21,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 129 transitions. [2021-10-21 20:25:21,174 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 129 transitions. Word has length 17 [2021-10-21 20:25:21,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:25:21,174 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 129 transitions. [2021-10-21 20:25:21,174 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 20:25:21,174 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 129 transitions. [2021-10-21 20:25:21,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-21 20:25:21,175 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:25:21,175 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:25:21,175 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-21 20:25:21,176 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr12REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 45 more)] === [2021-10-21 20:25:21,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:25:21,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1283297350, now seen corresponding path program 1 times [2021-10-21 20:25:21,176 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:25:21,177 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975640566] [2021-10-21 20:25:21,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:25:21,177 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:25:21,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:25:21,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 20:25:21,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:25:21,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:25:21,339 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:25:21,339 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975640566] [2021-10-21 20:25:21,339 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975640566] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:25:21,340 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:25:21,340 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-21 20:25:21,340 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807453935] [2021-10-21 20:25:21,340 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-21 20:25:21,341 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:25:21,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-21 20:25:21,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-10-21 20:25:21,342 INFO L87 Difference]: Start difference. First operand 115 states and 129 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 20:25:21,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:25:21,778 INFO L93 Difference]: Finished difference Result 123 states and 138 transitions. [2021-10-21 20:25:21,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-21 20:25:21,778 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2021-10-21 20:25:21,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:25:21,779 INFO L225 Difference]: With dead ends: 123 [2021-10-21 20:25:21,779 INFO L226 Difference]: Without dead ends: 123 [2021-10-21 20:25:21,780 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 163.9ms TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2021-10-21 20:25:21,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2021-10-21 20:25:21,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 114. [2021-10-21 20:25:21,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 84 states have (on average 1.4880952380952381) internal successors, (125), 110 states have internal predecessors, (125), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 20:25:21,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 128 transitions. [2021-10-21 20:25:21,783 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 128 transitions. Word has length 19 [2021-10-21 20:25:21,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:25:21,784 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 128 transitions. [2021-10-21 20:25:21,784 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 20:25:21,784 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 128 transitions. [2021-10-21 20:25:21,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-21 20:25:21,785 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:25:21,785 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:25:21,785 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-21 20:25:21,785 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr13REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 45 more)] === [2021-10-21 20:25:21,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:25:21,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1283297351, now seen corresponding path program 1 times [2021-10-21 20:25:21,786 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:25:21,786 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036565340] [2021-10-21 20:25:21,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:25:21,786 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:25:21,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:25:21,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 20:25:21,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:25:21,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:25:21,963 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:25:21,963 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036565340] [2021-10-21 20:25:21,964 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036565340] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:25:21,964 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:25:21,964 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-21 20:25:21,964 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166787557] [2021-10-21 20:25:21,965 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-21 20:25:21,965 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:25:21,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-21 20:25:21,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-10-21 20:25:21,966 INFO L87 Difference]: Start difference. First operand 114 states and 128 transitions. Second operand has 11 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 20:25:22,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:25:22,556 INFO L93 Difference]: Finished difference Result 118 states and 133 transitions. [2021-10-21 20:25:22,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-21 20:25:22,556 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2021-10-21 20:25:22,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:25:22,557 INFO L225 Difference]: With dead ends: 118 [2021-10-21 20:25:22,558 INFO L226 Difference]: Without dead ends: 118 [2021-10-21 20:25:22,558 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 334.2ms TimeCoverageRelationStatistics Valid=142, Invalid=410, Unknown=0, NotChecked=0, Total=552 [2021-10-21 20:25:22,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-10-21 20:25:22,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 102. [2021-10-21 20:25:22,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 78 states have (on average 1.4487179487179487) internal successors, (113), 98 states have internal predecessors, (113), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 20:25:22,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 116 transitions. [2021-10-21 20:25:22,562 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 116 transitions. Word has length 19 [2021-10-21 20:25:22,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:25:22,562 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 116 transitions. [2021-10-21 20:25:22,563 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 20:25:22,563 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 116 transitions. [2021-10-21 20:25:22,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-21 20:25:22,564 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:25:22,564 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-10-21 20:25:22,564 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-21 20:25:22,564 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr26REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 45 more)] === [2021-10-21 20:25:22,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:25:22,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1125022770, now seen corresponding path program 1 times [2021-10-21 20:25:22,565 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:25:22,565 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892754405] [2021-10-21 20:25:22,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:25:22,566 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:25:22,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:25:22,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 20:25:22,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:25:22,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:25:22,730 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:25:22,730 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892754405] [2021-10-21 20:25:22,730 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892754405] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:25:22,730 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:25:22,730 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-21 20:25:22,730 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407818626] [2021-10-21 20:25:22,731 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-21 20:25:22,731 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:25:22,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-21 20:25:22,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-10-21 20:25:22,732 INFO L87 Difference]: Start difference. First operand 102 states and 116 transitions. Second operand has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 20:25:23,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:25:23,096 INFO L93 Difference]: Finished difference Result 150 states and 161 transitions. [2021-10-21 20:25:23,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-21 20:25:23,097 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2021-10-21 20:25:23,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:25:23,098 INFO L225 Difference]: With dead ends: 150 [2021-10-21 20:25:23,098 INFO L226 Difference]: Without dead ends: 150 [2021-10-21 20:25:23,099 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 172.0ms TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2021-10-21 20:25:23,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2021-10-21 20:25:23,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 102. [2021-10-21 20:25:23,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 78 states have (on average 1.435897435897436) internal successors, (112), 98 states have internal predecessors, (112), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 20:25:23,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 115 transitions. [2021-10-21 20:25:23,103 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 115 transitions. Word has length 20 [2021-10-21 20:25:23,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:25:23,104 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 115 transitions. [2021-10-21 20:25:23,104 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 20:25:23,104 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 115 transitions. [2021-10-21 20:25:23,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-21 20:25:23,105 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:25:23,105 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-10-21 20:25:23,105 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-21 20:25:23,105 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr27REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 45 more)] === [2021-10-21 20:25:23,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:25:23,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1125022769, now seen corresponding path program 1 times [2021-10-21 20:25:23,106 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:25:23,106 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278426026] [2021-10-21 20:25:23,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:25:23,107 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:25:23,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:25:23,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 20:25:23,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:25:23,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:25:23,285 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:25:23,285 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278426026] [2021-10-21 20:25:23,285 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278426026] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:25:23,286 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:25:23,286 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-21 20:25:23,286 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652890567] [2021-10-21 20:25:23,286 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-21 20:25:23,286 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:25:23,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-21 20:25:23,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-10-21 20:25:23,288 INFO L87 Difference]: Start difference. First operand 102 states and 115 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 20:25:23,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:25:23,650 INFO L93 Difference]: Finished difference Result 160 states and 171 transitions. [2021-10-21 20:25:23,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-21 20:25:23,650 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2021-10-21 20:25:23,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:25:23,651 INFO L225 Difference]: With dead ends: 160 [2021-10-21 20:25:23,651 INFO L226 Difference]: Without dead ends: 160 [2021-10-21 20:25:23,652 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 141.1ms TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2021-10-21 20:25:23,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-10-21 20:25:23,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 102. [2021-10-21 20:25:23,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 78 states have (on average 1.4230769230769231) internal successors, (111), 98 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 20:25:23,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 114 transitions. [2021-10-21 20:25:23,656 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 114 transitions. Word has length 20 [2021-10-21 20:25:23,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:25:23,656 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 114 transitions. [2021-10-21 20:25:23,657 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 20:25:23,657 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 114 transitions. [2021-10-21 20:25:23,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-21 20:25:23,658 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:25:23,658 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:25:23,658 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-21 20:25:23,658 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr39REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 45 more)] === [2021-10-21 20:25:23,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:25:23,659 INFO L82 PathProgramCache]: Analyzing trace with hash -515982295, now seen corresponding path program 1 times [2021-10-21 20:25:23,659 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:25:23,659 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007574737] [2021-10-21 20:25:23,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:25:23,660 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:25:23,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:25:23,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 20:25:23,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:25:23,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:25:23,736 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:25:23,736 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007574737] [2021-10-21 20:25:23,737 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007574737] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:25:23,737 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:25:23,737 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-21 20:25:23,737 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375796668] [2021-10-21 20:25:23,738 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-21 20:25:23,738 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:25:23,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-21 20:25:23,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-10-21 20:25:23,739 INFO L87 Difference]: Start difference. First operand 102 states and 114 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 20:25:24,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:25:24,029 INFO L93 Difference]: Finished difference Result 139 states and 154 transitions. [2021-10-21 20:25:24,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-21 20:25:24,029 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2021-10-21 20:25:24,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:25:24,030 INFO L225 Difference]: With dead ends: 139 [2021-10-21 20:25:24,031 INFO L226 Difference]: Without dead ends: 139 [2021-10-21 20:25:24,031 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 84.8ms TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2021-10-21 20:25:24,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-10-21 20:25:24,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 103. [2021-10-21 20:25:24,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 79 states have (on average 1.4303797468354431) internal successors, (113), 99 states have internal predecessors, (113), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 20:25:24,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2021-10-21 20:25:24,034 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 21 [2021-10-21 20:25:24,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:25:24,035 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2021-10-21 20:25:24,035 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 20:25:24,035 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2021-10-21 20:25:24,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-21 20:25:24,036 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:25:24,036 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:25:24,036 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-21 20:25:24,036 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr40REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 45 more)] === [2021-10-21 20:25:24,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:25:24,036 INFO L82 PathProgramCache]: Analyzing trace with hash -515982294, now seen corresponding path program 1 times [2021-10-21 20:25:24,037 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:25:24,037 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243093665] [2021-10-21 20:25:24,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:25:24,037 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:25:24,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:25:24,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 20:25:24,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:25:24,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:25:24,215 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:25:24,215 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243093665] [2021-10-21 20:25:24,215 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243093665] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:25:24,215 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:25:24,216 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-21 20:25:24,216 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447576325] [2021-10-21 20:25:24,216 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-21 20:25:24,216 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:25:24,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-21 20:25:24,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-21 20:25:24,219 INFO L87 Difference]: Start difference. First operand 103 states and 116 transitions. Second operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 20:25:24,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:25:24,718 INFO L93 Difference]: Finished difference Result 150 states and 162 transitions. [2021-10-21 20:25:24,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-21 20:25:24,718 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2021-10-21 20:25:24,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:25:24,719 INFO L225 Difference]: With dead ends: 150 [2021-10-21 20:25:24,719 INFO L226 Difference]: Without dead ends: 150 [2021-10-21 20:25:24,720 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 250.4ms TimeCoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2021-10-21 20:25:24,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2021-10-21 20:25:24,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 122. [2021-10-21 20:25:24,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 98 states have (on average 1.489795918367347) internal successors, (146), 118 states have internal predecessors, (146), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 20:25:24,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 149 transitions. [2021-10-21 20:25:24,724 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 149 transitions. Word has length 21 [2021-10-21 20:25:24,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:25:24,724 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 149 transitions. [2021-10-21 20:25:24,725 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 20:25:24,725 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 149 transitions. [2021-10-21 20:25:24,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-21 20:25:24,726 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:25:24,726 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:25:24,726 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-21 20:25:24,726 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr46ASSERT_VIOLATIONMEMORY_FREE === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 45 more)] === [2021-10-21 20:25:24,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:25:24,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1937741512, now seen corresponding path program 1 times [2021-10-21 20:25:24,727 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:25:24,727 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275764363] [2021-10-21 20:25:24,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:25:24,728 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:25:24,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:25:24,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 20:25:24,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:25:24,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:25:24,967 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:25:24,967 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275764363] [2021-10-21 20:25:24,967 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275764363] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:25:24,967 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:25:24,967 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-21 20:25:24,968 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273034934] [2021-10-21 20:25:24,968 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-21 20:25:24,968 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:25:24,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-21 20:25:24,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2021-10-21 20:25:24,969 INFO L87 Difference]: Start difference. First operand 122 states and 149 transitions. Second operand has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 20:25:25,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:25:25,427 INFO L93 Difference]: Finished difference Result 164 states and 175 transitions. [2021-10-21 20:25:25,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-21 20:25:25,428 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2021-10-21 20:25:25,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:25:25,429 INFO L225 Difference]: With dead ends: 164 [2021-10-21 20:25:25,429 INFO L226 Difference]: Without dead ends: 164 [2021-10-21 20:25:25,430 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 245.3ms TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2021-10-21 20:25:25,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2021-10-21 20:25:25,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 123. [2021-10-21 20:25:25,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 99 states have (on average 1.4848484848484849) internal successors, (147), 119 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 20:25:25,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 150 transitions. [2021-10-21 20:25:25,434 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 150 transitions. Word has length 23 [2021-10-21 20:25:25,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:25:25,434 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 150 transitions. [2021-10-21 20:25:25,434 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 20:25:25,434 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 150 transitions. [2021-10-21 20:25:25,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-21 20:25:25,435 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:25:25,435 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:25:25,435 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-21 20:25:25,435 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr47ASSERT_VIOLATIONMEMORY_FREE === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 45 more)] === [2021-10-21 20:25:25,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:25:25,436 INFO L82 PathProgramCache]: Analyzing trace with hash 59555505, now seen corresponding path program 1 times [2021-10-21 20:25:25,436 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:25:25,436 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769470558] [2021-10-21 20:25:25,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:25:25,436 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:25:25,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:25:25,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 20:25:25,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:25:25,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:25:25,581 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:25:25,582 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769470558] [2021-10-21 20:25:25,582 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769470558] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:25:25,582 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:25:25,582 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-21 20:25:25,582 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239929180] [2021-10-21 20:25:25,583 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-21 20:25:25,583 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:25:25,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-21 20:25:25,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-10-21 20:25:25,584 INFO L87 Difference]: Start difference. First operand 123 states and 150 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 20:25:25,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:25:25,882 INFO L93 Difference]: Finished difference Result 156 states and 170 transitions. [2021-10-21 20:25:25,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-21 20:25:25,882 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2021-10-21 20:25:25,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:25:25,883 INFO L225 Difference]: With dead ends: 156 [2021-10-21 20:25:25,883 INFO L226 Difference]: Without dead ends: 156 [2021-10-21 20:25:25,884 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 111.1ms TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2021-10-21 20:25:25,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-10-21 20:25:25,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 124. [2021-10-21 20:25:25,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 100 states have (on average 1.48) internal successors, (148), 120 states have internal predecessors, (148), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 20:25:25,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 151 transitions. [2021-10-21 20:25:25,888 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 151 transitions. Word has length 24 [2021-10-21 20:25:25,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:25:25,888 INFO L470 AbstractCegarLoop]: Abstraction has 124 states and 151 transitions. [2021-10-21 20:25:25,888 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 20:25:25,889 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 151 transitions. [2021-10-21 20:25:25,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-21 20:25:25,890 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:25:25,890 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:25:25,890 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-21 20:25:25,890 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr34ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 45 more)] === [2021-10-21 20:25:25,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:25:25,891 INFO L82 PathProgramCache]: Analyzing trace with hash 503255293, now seen corresponding path program 1 times [2021-10-21 20:25:25,891 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:25:25,891 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213873778] [2021-10-21 20:25:25,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:25:25,892 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:25:25,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:25:26,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 20:25:26,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:25:26,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:25:26,111 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:25:26,111 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213873778] [2021-10-21 20:25:26,111 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213873778] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:25:26,111 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:25:26,111 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-10-21 20:25:26,111 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080348524] [2021-10-21 20:25:26,112 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-21 20:25:26,112 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:25:26,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-21 20:25:26,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-21 20:25:26,113 INFO L87 Difference]: Start difference. First operand 124 states and 151 transitions. Second operand has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 20:25:26,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:25:26,670 INFO L93 Difference]: Finished difference Result 147 states and 158 transitions. [2021-10-21 20:25:26,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-21 20:25:26,670 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2021-10-21 20:25:26,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:25:26,671 INFO L225 Difference]: With dead ends: 147 [2021-10-21 20:25:26,671 INFO L226 Difference]: Without dead ends: 147 [2021-10-21 20:25:26,672 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 302.4ms TimeCoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2021-10-21 20:25:26,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-10-21 20:25:26,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 124. [2021-10-21 20:25:26,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 100 states have (on average 1.47) internal successors, (147), 120 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 20:25:26,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 150 transitions. [2021-10-21 20:25:26,676 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 150 transitions. Word has length 24 [2021-10-21 20:25:26,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:25:26,676 INFO L470 AbstractCegarLoop]: Abstraction has 124 states and 150 transitions. [2021-10-21 20:25:26,676 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 20:25:26,676 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 150 transitions. [2021-10-21 20:25:26,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-21 20:25:26,677 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:25:26,678 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:25:26,678 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-21 20:25:26,678 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr16ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 45 more)] === [2021-10-21 20:25:26,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:25:26,679 INFO L82 PathProgramCache]: Analyzing trace with hash 735159435, now seen corresponding path program 1 times [2021-10-21 20:25:26,679 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:25:26,679 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699279538] [2021-10-21 20:25:26,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:25:26,679 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:25:26,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:25:26,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 20:25:26,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:25:26,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:25:26,815 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:25:26,815 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699279538] [2021-10-21 20:25:26,815 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699279538] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:25:26,815 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:25:26,815 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-21 20:25:26,816 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007378121] [2021-10-21 20:25:26,816 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-21 20:25:26,816 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:25:26,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-21 20:25:26,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-10-21 20:25:26,817 INFO L87 Difference]: Start difference. First operand 124 states and 150 transitions. Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 20:25:27,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:25:27,209 INFO L93 Difference]: Finished difference Result 158 states and 188 transitions. [2021-10-21 20:25:27,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-21 20:25:27,213 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2021-10-21 20:25:27,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:25:27,214 INFO L225 Difference]: With dead ends: 158 [2021-10-21 20:25:27,214 INFO L226 Difference]: Without dead ends: 158 [2021-10-21 20:25:27,215 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 136.5ms TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2021-10-21 20:25:27,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2021-10-21 20:25:27,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 138. [2021-10-21 20:25:27,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 114 states have (on average 1.4385964912280702) internal successors, (164), 134 states have internal predecessors, (164), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 20:25:27,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 167 transitions. [2021-10-21 20:25:27,226 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 167 transitions. Word has length 24 [2021-10-21 20:25:27,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:25:27,227 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 167 transitions. [2021-10-21 20:25:27,228 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 20:25:27,228 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 167 transitions. [2021-10-21 20:25:27,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-21 20:25:27,231 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:25:27,231 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:25:27,231 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-21 20:25:27,231 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr43ASSERT_VIOLATIONMEMORY_FREE === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 45 more)] === [2021-10-21 20:25:27,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:25:27,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1846266602, now seen corresponding path program 1 times [2021-10-21 20:25:27,232 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:25:27,232 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263277315] [2021-10-21 20:25:27,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:25:27,233 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:25:27,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:25:27,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 20:25:27,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:25:27,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:25:27,340 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:25:27,341 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263277315] [2021-10-21 20:25:27,341 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263277315] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:25:27,341 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:25:27,341 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-21 20:25:27,341 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657721906] [2021-10-21 20:25:27,342 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-21 20:25:27,342 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:25:27,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-21 20:25:27,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-10-21 20:25:27,343 INFO L87 Difference]: Start difference. First operand 138 states and 167 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 20:25:27,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:25:27,580 INFO L93 Difference]: Finished difference Result 155 states and 172 transitions. [2021-10-21 20:25:27,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-21 20:25:27,581 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2021-10-21 20:25:27,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:25:27,582 INFO L225 Difference]: With dead ends: 155 [2021-10-21 20:25:27,582 INFO L226 Difference]: Without dead ends: 155 [2021-10-21 20:25:27,583 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 86.7ms TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2021-10-21 20:25:27,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-10-21 20:25:27,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 140. [2021-10-21 20:25:27,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 116 states have (on average 1.4310344827586208) internal successors, (166), 136 states have internal predecessors, (166), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 20:25:27,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 169 transitions. [2021-10-21 20:25:27,588 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 169 transitions. Word has length 25 [2021-10-21 20:25:27,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:25:27,588 INFO L470 AbstractCegarLoop]: Abstraction has 140 states and 169 transitions. [2021-10-21 20:25:27,588 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 20:25:27,588 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 169 transitions. [2021-10-21 20:25:27,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-21 20:25:27,589 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:25:27,589 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:25:27,589 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-21 20:25:27,589 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr33REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 45 more)] === [2021-10-21 20:25:27,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:25:27,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1579327267, now seen corresponding path program 1 times [2021-10-21 20:25:27,590 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:25:27,590 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730432643] [2021-10-21 20:25:27,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:25:27,591 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:25:27,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:25:27,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 20:25:27,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:25:27,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:25:27,756 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:25:27,756 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730432643] [2021-10-21 20:25:27,756 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730432643] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:25:27,756 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:25:27,756 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-21 20:25:27,757 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752253755] [2021-10-21 20:25:27,757 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-21 20:25:27,757 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:25:27,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-21 20:25:27,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-10-21 20:25:27,758 INFO L87 Difference]: Start difference. First operand 140 states and 169 transitions. Second operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 20:25:28,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:25:28,190 INFO L93 Difference]: Finished difference Result 161 states and 175 transitions. [2021-10-21 20:25:28,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-21 20:25:28,201 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2021-10-21 20:25:28,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:25:28,202 INFO L225 Difference]: With dead ends: 161 [2021-10-21 20:25:28,202 INFO L226 Difference]: Without dead ends: 161 [2021-10-21 20:25:28,203 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 227.3ms TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2021-10-21 20:25:28,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2021-10-21 20:25:28,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 140. [2021-10-21 20:25:28,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 116 states have (on average 1.4224137931034482) internal successors, (165), 136 states have internal predecessors, (165), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 20:25:28,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 168 transitions. [2021-10-21 20:25:28,208 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 168 transitions. Word has length 25 [2021-10-21 20:25:28,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:25:28,208 INFO L470 AbstractCegarLoop]: Abstraction has 140 states and 168 transitions. [2021-10-21 20:25:28,208 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 20:25:28,208 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 168 transitions. [2021-10-21 20:25:28,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-21 20:25:28,209 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:25:28,209 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:25:28,209 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-21 20:25:28,210 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr32REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 45 more)] === [2021-10-21 20:25:28,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:25:28,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1579327268, now seen corresponding path program 1 times [2021-10-21 20:25:28,210 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:25:28,210 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212289398] [2021-10-21 20:25:28,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:25:28,211 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:25:28,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:25:28,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 20:25:28,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:25:28,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:25:28,262 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:25:28,263 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212289398] [2021-10-21 20:25:28,263 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212289398] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:25:28,263 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:25:28,263 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-21 20:25:28,263 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516788195] [2021-10-21 20:25:28,264 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-21 20:25:28,264 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:25:28,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-21 20:25:28,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-21 20:25:28,265 INFO L87 Difference]: Start difference. First operand 140 states and 168 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 20:25:28,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:25:28,426 INFO L93 Difference]: Finished difference Result 141 states and 169 transitions. [2021-10-21 20:25:28,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-21 20:25:28,428 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2021-10-21 20:25:28,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:25:28,431 INFO L225 Difference]: With dead ends: 141 [2021-10-21 20:25:28,431 INFO L226 Difference]: Without dead ends: 141 [2021-10-21 20:25:28,433 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 35.8ms TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-10-21 20:25:28,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-10-21 20:25:28,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 139. [2021-10-21 20:25:28,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 116 states have (on average 1.396551724137931) internal successors, (162), 135 states have internal predecessors, (162), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 20:25:28,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 165 transitions. [2021-10-21 20:25:28,439 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 165 transitions. Word has length 25 [2021-10-21 20:25:28,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:25:28,439 INFO L470 AbstractCegarLoop]: Abstraction has 139 states and 165 transitions. [2021-10-21 20:25:28,439 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 20:25:28,440 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 165 transitions. [2021-10-21 20:25:28,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-10-21 20:25:28,440 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:25:28,440 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-10-21 20:25:28,441 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-21 20:25:28,441 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr49ENSURES_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 45 more)] === [2021-10-21 20:25:28,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:25:28,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1398272980, now seen corresponding path program 1 times [2021-10-21 20:25:28,441 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:25:28,442 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12593822] [2021-10-21 20:25:28,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:25:28,442 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:25:28,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:25:28,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 20:25:28,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:25:28,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:25:28,648 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:25:28,648 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12593822] [2021-10-21 20:25:28,648 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12593822] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:25:28,648 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:25:28,648 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-21 20:25:28,648 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468682181] [2021-10-21 20:25:28,649 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-21 20:25:28,649 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:25:28,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-21 20:25:28,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-10-21 20:25:28,650 INFO L87 Difference]: Start difference. First operand 139 states and 165 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 20:25:29,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:25:29,010 INFO L93 Difference]: Finished difference Result 156 states and 169 transitions. [2021-10-21 20:25:29,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-21 20:25:29,010 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2021-10-21 20:25:29,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:25:29,011 INFO L225 Difference]: With dead ends: 156 [2021-10-21 20:25:29,011 INFO L226 Difference]: Without dead ends: 156 [2021-10-21 20:25:29,012 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 186.4ms TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2021-10-21 20:25:29,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-10-21 20:25:29,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 139. [2021-10-21 20:25:29,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 116 states have (on average 1.3879310344827587) internal successors, (161), 135 states have internal predecessors, (161), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 20:25:29,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 164 transitions. [2021-10-21 20:25:29,016 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 164 transitions. Word has length 26 [2021-10-21 20:25:29,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:25:29,017 INFO L470 AbstractCegarLoop]: Abstraction has 139 states and 164 transitions. [2021-10-21 20:25:29,017 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 20:25:29,017 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 164 transitions. [2021-10-21 20:25:29,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-10-21 20:25:29,018 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:25:29,018 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:25:29,018 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-21 20:25:29,018 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr34ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 45 more)] === [2021-10-21 20:25:29,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:25:29,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1628201079, now seen corresponding path program 1 times [2021-10-21 20:25:29,019 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:25:29,019 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038066210] [2021-10-21 20:25:29,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:25:29,020 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:25:29,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 20:25:29,034 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 20:25:29,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 20:25:29,073 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 20:25:29,073 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-10-21 20:25:29,074 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location mainErr34ASSERT_VIOLATIONMEMORY_LEAK [2021-10-21 20:25:29,076 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr0REQUIRES_VIOLATION [2021-10-21 20:25:29,077 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr1REQUIRES_VIOLATION [2021-10-21 20:25:29,077 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr2REQUIRES_VIOLATION [2021-10-21 20:25:29,077 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr3REQUIRES_VIOLATION [2021-10-21 20:25:29,077 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr4REQUIRES_VIOLATION [2021-10-21 20:25:29,078 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr5REQUIRES_VIOLATION [2021-10-21 20:25:29,078 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr6REQUIRES_VIOLATION [2021-10-21 20:25:29,078 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr7REQUIRES_VIOLATION [2021-10-21 20:25:29,078 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr8REQUIRES_VIOLATION [2021-10-21 20:25:29,078 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr9REQUIRES_VIOLATION [2021-10-21 20:25:29,079 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr10REQUIRES_VIOLATION [2021-10-21 20:25:29,079 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr11REQUIRES_VIOLATION [2021-10-21 20:25:29,079 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr12REQUIRES_VIOLATION [2021-10-21 20:25:29,079 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr13REQUIRES_VIOLATION [2021-10-21 20:25:29,079 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr14REQUIRES_VIOLATION [2021-10-21 20:25:29,080 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr15REQUIRES_VIOLATION [2021-10-21 20:25:29,080 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr16ASSERT_VIOLATIONMEMORY_LEAK [2021-10-21 20:25:29,080 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr17REQUIRES_VIOLATION [2021-10-21 20:25:29,080 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr18REQUIRES_VIOLATION [2021-10-21 20:25:29,080 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr19REQUIRES_VIOLATION [2021-10-21 20:25:29,080 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr20REQUIRES_VIOLATION [2021-10-21 20:25:29,081 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr21ASSERT_VIOLATIONMEMORY_LEAK [2021-10-21 20:25:29,081 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr22REQUIRES_VIOLATION [2021-10-21 20:25:29,081 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr23REQUIRES_VIOLATION [2021-10-21 20:25:29,081 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr24REQUIRES_VIOLATION [2021-10-21 20:25:29,081 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr25REQUIRES_VIOLATION [2021-10-21 20:25:29,082 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr26REQUIRES_VIOLATION [2021-10-21 20:25:29,082 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr27REQUIRES_VIOLATION [2021-10-21 20:25:29,082 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr28REQUIRES_VIOLATION [2021-10-21 20:25:29,082 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr29REQUIRES_VIOLATION [2021-10-21 20:25:29,082 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr30REQUIRES_VIOLATION [2021-10-21 20:25:29,083 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr31REQUIRES_VIOLATION [2021-10-21 20:25:29,083 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr32REQUIRES_VIOLATION [2021-10-21 20:25:29,083 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr33REQUIRES_VIOLATION [2021-10-21 20:25:29,083 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr35REQUIRES_VIOLATION [2021-10-21 20:25:29,083 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr36REQUIRES_VIOLATION [2021-10-21 20:25:29,083 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr37REQUIRES_VIOLATION [2021-10-21 20:25:29,084 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr38REQUIRES_VIOLATION [2021-10-21 20:25:29,084 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr39REQUIRES_VIOLATION [2021-10-21 20:25:29,084 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr40REQUIRES_VIOLATION [2021-10-21 20:25:29,084 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr41REQUIRES_VIOLATION [2021-10-21 20:25:29,084 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr42REQUIRES_VIOLATION [2021-10-21 20:25:29,085 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr43ASSERT_VIOLATIONMEMORY_FREE [2021-10-21 20:25:29,085 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr44ASSERT_VIOLATIONMEMORY_FREE [2021-10-21 20:25:29,085 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr45ASSERT_VIOLATIONMEMORY_FREE [2021-10-21 20:25:29,085 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr46ASSERT_VIOLATIONMEMORY_FREE [2021-10-21 20:25:29,085 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr47ASSERT_VIOLATIONMEMORY_FREE [2021-10-21 20:25:29,086 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr48ASSERT_VIOLATIONMEMORY_FREE [2021-10-21 20:25:29,086 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr49ENSURES_VIOLATIONMEMORY_LEAK [2021-10-21 20:25:29,086 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-21 20:25:29,093 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-21 20:25:29,130 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.10 08:25:29 BoogieIcfgContainer [2021-10-21 20:25:29,133 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-21 20:25:29,134 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-21 20:25:29,135 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-21 20:25:29,135 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-21 20:25:29,136 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 08:25:16" (3/4) ... [2021-10-21 20:25:29,138 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-21 20:25:29,206 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d4c591a-4fea-4475-9529-c72f4b00fe13/bin/uautomizer-j4sWxH34Be/witness.graphml [2021-10-21 20:25:29,206 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-21 20:25:29,208 INFO L168 Benchmark]: Toolchain (without parser) took 14115.10 ms. Allocated memory was 100.7 MB in the beginning and 153.1 MB in the end (delta: 52.4 MB). Free memory was 59.0 MB in the beginning and 123.7 MB in the end (delta: -64.7 MB). Peak memory consumption was 77.4 MB. Max. memory is 16.1 GB. [2021-10-21 20:25:29,208 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 100.7 MB. Free memory was 76.4 MB in the beginning and 76.4 MB in the end (delta: 53.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-21 20:25:29,209 INFO L168 Benchmark]: CACSL2BoogieTranslator took 629.15 ms. Allocated memory is still 100.7 MB. Free memory was 58.9 MB in the beginning and 68.7 MB in the end (delta: -9.8 MB). Peak memory consumption was 4.4 MB. Max. memory is 16.1 GB. [2021-10-21 20:25:29,210 INFO L168 Benchmark]: Boogie Preprocessor took 67.39 ms. Allocated memory is still 100.7 MB. Free memory was 68.7 MB in the beginning and 65.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-21 20:25:29,210 INFO L168 Benchmark]: RCFGBuilder took 749.10 ms. Allocated memory is still 100.7 MB. Free memory was 65.6 MB in the beginning and 41.6 MB in the end (delta: 24.1 MB). Peak memory consumption was 25.2 MB. Max. memory is 16.1 GB. [2021-10-21 20:25:29,211 INFO L168 Benchmark]: TraceAbstraction took 12591.24 ms. Allocated memory was 100.7 MB in the beginning and 153.1 MB in the end (delta: 52.4 MB). Free memory was 41.0 MB in the beginning and 39.2 MB in the end (delta: 1.8 MB). Peak memory consumption was 56.1 MB. Max. memory is 16.1 GB. [2021-10-21 20:25:29,211 INFO L168 Benchmark]: Witness Printer took 72.84 ms. Allocated memory is still 153.1 MB. Free memory was 38.2 MB in the beginning and 123.7 MB in the end (delta: -85.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-21 20:25:29,213 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.32 ms. Allocated memory is still 100.7 MB. Free memory was 76.4 MB in the beginning and 76.4 MB in the end (delta: 53.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 629.15 ms. Allocated memory is still 100.7 MB. Free memory was 58.9 MB in the beginning and 68.7 MB in the end (delta: -9.8 MB). Peak memory consumption was 4.4 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 67.39 ms. Allocated memory is still 100.7 MB. Free memory was 68.7 MB in the beginning and 65.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 749.10 ms. Allocated memory is still 100.7 MB. Free memory was 65.6 MB in the beginning and 41.6 MB in the end (delta: 24.1 MB). Peak memory consumption was 25.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 12591.24 ms. Allocated memory was 100.7 MB in the beginning and 153.1 MB in the end (delta: 52.4 MB). Free memory was 41.0 MB in the beginning and 39.2 MB in the end (delta: 1.8 MB). Peak memory consumption was 56.1 MB. Max. memory is 16.1 GB. * Witness Printer took 72.84 ms. Allocated memory is still 153.1 MB. Free memory was 38.2 MB in the beginning and 123.7 MB in the end (delta: -85.5 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: 1034]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L997] SLL* head = malloc(sizeof(SLL)); [L998] head->next = head VAL [head={-1:0}] [L999] head->data = 0 VAL [head={-1:0}] [L1001] SLL* x = head; [L1002] int state = 1; VAL [head={-1:0}, state=1, x={-1:0}] [L1005] COND FALSE !(__VERIFIER_nondet_int()) [L1027] x->data = state VAL [head={-1:0}, state=1, x={-1:0}] [L1029] EXPR head->next VAL [head={-1:0}, head->next={-1:0}, state=1, x={-1:0}] [L1029] x = head->next [L1030] COND FALSE !(!(((void*)0) != x)) VAL [head={-1:0}, state=1, x={-1:0}] [L1032] EXPR x->data VAL [head={-1:0}, state=1, x={-1:0}, x->data=1] [L1032] COND TRUE x->data != 0 [L1034] EXPR x->next VAL [head={-1:0}, state=1, x={-1:0}, x->next={-1:0}] [L1034] EXPR x->next->data VAL [head={-1:0}, state=1, x={-1:0}, x->next={-1:0}, x->next->data=1] [L1034] EXPR x->next->data != 0 && x->data > x->next->data VAL [head={-1:0}, state=1, x={-1:0}, x->next={-1:0}, x->next->data=1, x->next->data != 0 && x->data > x->next->data=1] [L1034] EXPR x->data VAL [head={-1:0}, state=1, x={-1:0}, x->data=1, x->next={-1:0}, x->next->data=1, x->next->data != 0 && x->data > x->next->data=1] [L1034] EXPR x->next VAL [head={-1:0}, state=1, x={-1:0}, x->data=1, x->next={-1:0}, x->next={-1:0}, x->next->data=1, x->next->data != 0 && x->data > x->next->data=1] [L1034] EXPR x->next->data VAL [head={-1:0}, state=1, x={-1:0}, x->data=1, x->next={-1:0}, x->next={-1:0}, x->next->data=1, x->next->data=1, x->next->data != 0 && x->data > x->next->data=1] [L1034] EXPR x->next->data != 0 && x->data > x->next->data VAL [head={-1:0}, state=1, x={-1:0}, x->data=1, x->next={-1:0}, x->next={-1:0}, x->next->data=1, x->next->data=1, x->next->data != 0 && x->data > x->next->data=0] [L1034] COND TRUE !(x->next->data != 0 && x->data > x->next->data) [L1034] reach_error() VAL [head={-1:0}, state=1, x={-1:0}] - UnprovableResult [Line: 998]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 998]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 999]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 999]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1008]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1008]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1009]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1009]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1009]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1009]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1010]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1010]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1011]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1011]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1023]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1023]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1025]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1027]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1027]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1029]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1029]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1030]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1034]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1034]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1034]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1034]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1034]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1034]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1034]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1034]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1034]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1034]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1035]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1035]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1038]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1038]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1040]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1040]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1043]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1043]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1046]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1046]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1046]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 994]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 117 locations, 50 error locations. Started 1 CEGAR loops. OverallTime: 12475.3ms, OverallIterations: 24, TraceHistogramMax: 1, EmptinessCheckTime: 32.2ms, AutomataDifference: 8122.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 17.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1484 SDtfs, 4003 SDslu, 4801 SDs, 0 SdLazy, 7176 SolverSat, 354 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4624.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 332 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 264 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 3182.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=140occurred in iteration=20, InterpolantAutomatonStates: 230, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 197.9ms AutomataMinimizationTime, 23 MinimizatonAttempts, 593 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 63.4ms SsaConstructionTime, 374.7ms SatisfiabilityAnalysisTime, 3165.3ms InterpolantComputationTime, 462 NumberOfCodeBlocks, 462 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 411 ConstructedInterpolants, 0 QuantifiedInterpolants, 4075 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 0/0 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-10-21 20:25:29,273 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d4c591a-4fea-4475-9529-c72f4b00fe13/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...