./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_9.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4e77c044 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ce24a88-5ad8-4d5b-ac90-3a24ce10df8a/bin/uautomizer-WNIpwEf4Nt/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ce24a88-5ad8-4d5b-ac90-3a24ce10df8a/bin/uautomizer-WNIpwEf4Nt/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ce24a88-5ad8-4d5b-ac90-3a24ce10df8a/bin/uautomizer-WNIpwEf4Nt/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ce24a88-5ad8-4d5b-ac90-3a24ce10df8a/bin/uautomizer-WNIpwEf4Nt/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_9.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ce24a88-5ad8-4d5b-ac90-3a24ce10df8a/bin/uautomizer-WNIpwEf4Nt/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ce24a88-5ad8-4d5b-ac90-3a24ce10df8a/bin/uautomizer-WNIpwEf4Nt --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 20a70402cc893fb2c7adec21ca8a267adc3c5cbb ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-4e77c04 [2021-10-13 00:53:41,676 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-13 00:53:41,679 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-13 00:53:41,737 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-13 00:53:41,738 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-13 00:53:41,743 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-13 00:53:41,745 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-13 00:53:41,753 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-13 00:53:41,756 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-13 00:53:41,762 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-13 00:53:41,764 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-13 00:53:41,765 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-13 00:53:41,766 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-13 00:53:41,767 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-13 00:53:41,769 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-13 00:53:41,771 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-13 00:53:41,773 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-13 00:53:41,774 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-13 00:53:41,777 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-13 00:53:41,786 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-13 00:53:41,789 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-13 00:53:41,790 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-13 00:53:41,797 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-13 00:53:41,798 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-13 00:53:41,808 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-13 00:53:41,809 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-13 00:53:41,809 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-13 00:53:41,812 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-13 00:53:41,812 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-13 00:53:41,814 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-13 00:53:41,816 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-13 00:53:41,817 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-13 00:53:41,819 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-13 00:53:41,821 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-13 00:53:41,823 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-13 00:53:41,823 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-13 00:53:41,824 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-13 00:53:41,825 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-13 00:53:41,825 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-13 00:53:41,826 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-13 00:53:41,828 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-13 00:53:41,829 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ce24a88-5ad8-4d5b-ac90-3a24ce10df8a/bin/uautomizer-WNIpwEf4Nt/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-13 00:53:41,885 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-13 00:53:41,886 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-13 00:53:41,887 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-13 00:53:41,887 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-13 00:53:41,889 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-13 00:53:41,889 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-13 00:53:41,889 INFO L138 SettingsManager]: * Use SBE=true [2021-10-13 00:53:41,890 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-13 00:53:41,890 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-13 00:53:41,890 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-13 00:53:41,891 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-13 00:53:41,892 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-13 00:53:41,892 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-13 00:53:41,892 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-13 00:53:41,893 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-13 00:53:41,893 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-13 00:53:41,893 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-13 00:53:41,893 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-13 00:53:41,894 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-13 00:53:41,894 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-13 00:53:41,894 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-13 00:53:41,895 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-13 00:53:41,895 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 00:53:41,895 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-13 00:53:41,896 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-13 00:53:41,896 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-13 00:53:41,896 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-13 00:53:41,896 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-13 00:53:41,897 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-13 00:53:41,899 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-13 00:53:41,899 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_2ce24a88-5ad8-4d5b-ac90-3a24ce10df8a/bin/uautomizer-WNIpwEf4Nt/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_2ce24a88-5ad8-4d5b-ac90-3a24ce10df8a/bin/uautomizer-WNIpwEf4Nt 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 ! call(reach_error())) ) 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 -> 20a70402cc893fb2c7adec21ca8a267adc3c5cbb [2021-10-13 00:53:42,261 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-13 00:53:42,300 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-13 00:53:42,303 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-13 00:53:42,305 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-13 00:53:42,306 INFO L275 PluginConnector]: CDTParser initialized [2021-10-13 00:53:42,307 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ce24a88-5ad8-4d5b-ac90-3a24ce10df8a/bin/uautomizer-WNIpwEf4Nt/../../sv-benchmarks/c/locks/test_locks_9.c [2021-10-13 00:53:42,418 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ce24a88-5ad8-4d5b-ac90-3a24ce10df8a/bin/uautomizer-WNIpwEf4Nt/data/cf9188d4e/fe1a4f39ff3f42209e3d05b05a9b2270/FLAGa3c31815b [2021-10-13 00:53:43,002 INFO L306 CDTParser]: Found 1 translation units. [2021-10-13 00:53:43,007 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ce24a88-5ad8-4d5b-ac90-3a24ce10df8a/sv-benchmarks/c/locks/test_locks_9.c [2021-10-13 00:53:43,023 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ce24a88-5ad8-4d5b-ac90-3a24ce10df8a/bin/uautomizer-WNIpwEf4Nt/data/cf9188d4e/fe1a4f39ff3f42209e3d05b05a9b2270/FLAGa3c31815b [2021-10-13 00:53:43,345 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ce24a88-5ad8-4d5b-ac90-3a24ce10df8a/bin/uautomizer-WNIpwEf4Nt/data/cf9188d4e/fe1a4f39ff3f42209e3d05b05a9b2270 [2021-10-13 00:53:43,348 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-13 00:53:43,350 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-13 00:53:43,352 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-13 00:53:43,352 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-13 00:53:43,356 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-13 00:53:43,357 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:53:43" (1/1) ... [2021-10-13 00:53:43,359 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60238988 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:53:43, skipping insertion in model container [2021-10-13 00:53:43,359 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:53:43" (1/1) ... [2021-10-13 00:53:43,367 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-13 00:53:43,388 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-13 00:53:43,600 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_2ce24a88-5ad8-4d5b-ac90-3a24ce10df8a/sv-benchmarks/c/locks/test_locks_9.c[3555,3568] [2021-10-13 00:53:43,605 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 00:53:43,615 INFO L203 MainTranslator]: Completed pre-run [2021-10-13 00:53:43,643 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_2ce24a88-5ad8-4d5b-ac90-3a24ce10df8a/sv-benchmarks/c/locks/test_locks_9.c[3555,3568] [2021-10-13 00:53:43,644 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 00:53:43,660 INFO L208 MainTranslator]: Completed translation [2021-10-13 00:53:43,661 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:53:43 WrapperNode [2021-10-13 00:53:43,661 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-13 00:53:43,663 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-13 00:53:43,663 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-13 00:53:43,663 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-13 00:53:43,672 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:53:43" (1/1) ... [2021-10-13 00:53:43,681 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:53:43" (1/1) ... [2021-10-13 00:53:43,710 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-13 00:53:43,711 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-13 00:53:43,712 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-13 00:53:43,712 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-13 00:53:43,722 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:53:43" (1/1) ... [2021-10-13 00:53:43,722 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:53:43" (1/1) ... [2021-10-13 00:53:43,728 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:53:43" (1/1) ... [2021-10-13 00:53:43,729 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:53:43" (1/1) ... [2021-10-13 00:53:43,749 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:53:43" (1/1) ... [2021-10-13 00:53:43,767 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:53:43" (1/1) ... [2021-10-13 00:53:43,769 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:53:43" (1/1) ... [2021-10-13 00:53:43,772 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-13 00:53:43,773 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-13 00:53:43,773 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-13 00:53:43,773 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-13 00:53:43,775 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:53:43" (1/1) ... [2021-10-13 00:53:43,792 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 00:53:43,805 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ce24a88-5ad8-4d5b-ac90-3a24ce10df8a/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:53:43,827 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ce24a88-5ad8-4d5b-ac90-3a24ce10df8a/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-13 00:53:43,830 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ce24a88-5ad8-4d5b-ac90-3a24ce10df8a/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-13 00:53:43,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-13 00:53:43,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-13 00:53:43,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-13 00:53:43,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-13 00:53:44,171 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-13 00:53:44,172 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2021-10-13 00:53:44,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:53:44 BoogieIcfgContainer [2021-10-13 00:53:44,175 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-13 00:53:44,176 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-13 00:53:44,177 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-13 00:53:44,181 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-13 00:53:44,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:53:43" (1/3) ... [2021-10-13 00:53:44,182 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2527884f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:53:44, skipping insertion in model container [2021-10-13 00:53:44,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:53:43" (2/3) ... [2021-10-13 00:53:44,183 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2527884f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:53:44, skipping insertion in model container [2021-10-13 00:53:44,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:53:44" (3/3) ... [2021-10-13 00:53:44,185 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_9.c [2021-10-13 00:53:44,191 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-13 00:53:44,192 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-13 00:53:44,251 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-13 00:53:44,259 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=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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-13 00:53:44,259 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-13 00:53:44,278 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 35 states have (on average 1.8857142857142857) internal successors, (66), 36 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:53:44,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-13 00:53:44,293 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:53:44,294 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:53:44,294 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:53:44,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:53:44,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1657621241, now seen corresponding path program 1 times [2021-10-13 00:53:44,325 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:53:44,339 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341757538] [2021-10-13 00:53:44,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:53:44,341 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:53:44,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:53:44,700 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-13 00:53:44,701 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:53:44,702 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341757538] [2021-10-13 00:53:44,703 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341757538] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:53:44,703 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:53:44,703 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:53:44,705 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581066686] [2021-10-13 00:53:44,711 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:53:44,712 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:53:44,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:53:44,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:53:44,753 INFO L87 Difference]: Start difference. First operand has 37 states, 35 states have (on average 1.8857142857142857) internal successors, (66), 36 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:53:44,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:53:44,798 INFO L93 Difference]: Finished difference Result 77 states and 133 transitions. [2021-10-13 00:53:44,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:53:44,801 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-10-13 00:53:44,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:53:44,812 INFO L225 Difference]: With dead ends: 77 [2021-10-13 00:53:44,812 INFO L226 Difference]: Without dead ends: 63 [2021-10-13 00:53:44,815 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:53:44,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-10-13 00:53:44,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 43. [2021-10-13 00:53:44,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.8571428571428572) internal successors, (78), 42 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:53:44,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 78 transitions. [2021-10-13 00:53:44,855 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 78 transitions. Word has length 16 [2021-10-13 00:53:44,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:53:44,856 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 78 transitions. [2021-10-13 00:53:44,857 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:53:44,857 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 78 transitions. [2021-10-13 00:53:44,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-13 00:53:44,858 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:53:44,858 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:53:44,859 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-13 00:53:44,859 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:53:44,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:53:44,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1399455803, now seen corresponding path program 1 times [2021-10-13 00:53:44,860 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:53:44,861 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58812749] [2021-10-13 00:53:44,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:53:44,861 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:53:44,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:53:44,927 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-13 00:53:44,927 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:53:44,928 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58812749] [2021-10-13 00:53:44,928 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58812749] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:53:44,928 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:53:44,929 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:53:44,929 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274641567] [2021-10-13 00:53:44,931 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:53:44,931 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:53:44,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:53:44,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:53:44,933 INFO L87 Difference]: Start difference. First operand 43 states and 78 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:53:44,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:53:44,960 INFO L93 Difference]: Finished difference Result 104 states and 189 transitions. [2021-10-13 00:53:44,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:53:44,961 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-10-13 00:53:44,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:53:44,963 INFO L225 Difference]: With dead ends: 104 [2021-10-13 00:53:44,963 INFO L226 Difference]: Without dead ends: 63 [2021-10-13 00:53:44,964 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:53:44,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-10-13 00:53:44,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2021-10-13 00:53:44,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.8333333333333333) internal successors, (110), 60 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:53:44,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 110 transitions. [2021-10-13 00:53:44,976 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 110 transitions. Word has length 16 [2021-10-13 00:53:44,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:53:44,976 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 110 transitions. [2021-10-13 00:53:44,977 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:53:44,977 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 110 transitions. [2021-10-13 00:53:44,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-13 00:53:44,978 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:53:44,979 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:53:44,979 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-13 00:53:44,980 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:53:44,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:53:44,981 INFO L82 PathProgramCache]: Analyzing trace with hash 153562753, now seen corresponding path program 1 times [2021-10-13 00:53:44,981 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:53:44,981 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963066171] [2021-10-13 00:53:44,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:53:44,982 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:53:45,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:53:45,040 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-13 00:53:45,041 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:53:45,041 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963066171] [2021-10-13 00:53:45,042 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963066171] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:53:45,042 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:53:45,042 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:53:45,043 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152266960] [2021-10-13 00:53:45,043 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:53:45,044 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:53:45,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:53:45,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:53:45,045 INFO L87 Difference]: Start difference. First operand 61 states and 110 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:53:45,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:53:45,067 INFO L93 Difference]: Finished difference Result 96 states and 168 transitions. [2021-10-13 00:53:45,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:53:45,068 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-10-13 00:53:45,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:53:45,070 INFO L225 Difference]: With dead ends: 96 [2021-10-13 00:53:45,070 INFO L226 Difference]: Without dead ends: 66 [2021-10-13 00:53:45,071 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:53:45,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2021-10-13 00:53:45,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2021-10-13 00:53:45,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.7777777777777777) internal successors, (112), 63 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:53:45,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 112 transitions. [2021-10-13 00:53:45,083 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 112 transitions. Word has length 17 [2021-10-13 00:53:45,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:53:45,083 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 112 transitions. [2021-10-13 00:53:45,084 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:53:45,084 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 112 transitions. [2021-10-13 00:53:45,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-13 00:53:45,085 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:53:45,085 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:53:45,086 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-13 00:53:45,086 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:53:45,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:53:45,087 INFO L82 PathProgramCache]: Analyzing trace with hash -433243261, now seen corresponding path program 1 times [2021-10-13 00:53:45,087 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:53:45,088 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092935179] [2021-10-13 00:53:45,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:53:45,089 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:53:45,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:53:45,142 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-13 00:53:45,143 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:53:45,143 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092935179] [2021-10-13 00:53:45,144 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092935179] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:53:45,144 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:53:45,144 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:53:45,145 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346074874] [2021-10-13 00:53:45,145 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:53:45,146 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:53:45,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:53:45,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:53:45,147 INFO L87 Difference]: Start difference. First operand 64 states and 112 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:53:45,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:53:45,170 INFO L93 Difference]: Finished difference Result 121 states and 213 transitions. [2021-10-13 00:53:45,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:53:45,171 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-10-13 00:53:45,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:53:45,173 INFO L225 Difference]: With dead ends: 121 [2021-10-13 00:53:45,173 INFO L226 Difference]: Without dead ends: 119 [2021-10-13 00:53:45,174 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:53:45,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-10-13 00:53:45,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 85. [2021-10-13 00:53:45,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 84 states have (on average 1.7738095238095237) internal successors, (149), 84 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:53:45,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 149 transitions. [2021-10-13 00:53:45,188 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 149 transitions. Word has length 17 [2021-10-13 00:53:45,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:53:45,189 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 149 transitions. [2021-10-13 00:53:45,190 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:53:45,190 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 149 transitions. [2021-10-13 00:53:45,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-13 00:53:45,191 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:53:45,192 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:53:45,192 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-13 00:53:45,192 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:53:45,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:53:45,193 INFO L82 PathProgramCache]: Analyzing trace with hash -175077823, now seen corresponding path program 1 times [2021-10-13 00:53:45,194 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:53:45,194 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176643310] [2021-10-13 00:53:45,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:53:45,195 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:53:45,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:53:45,244 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-13 00:53:45,244 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:53:45,245 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176643310] [2021-10-13 00:53:45,245 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176643310] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:53:45,245 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:53:45,246 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:53:45,246 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787803537] [2021-10-13 00:53:45,247 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:53:45,247 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:53:45,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:53:45,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:53:45,249 INFO L87 Difference]: Start difference. First operand 85 states and 149 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:53:45,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:53:45,271 INFO L93 Difference]: Finished difference Result 201 states and 355 transitions. [2021-10-13 00:53:45,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:53:45,272 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-10-13 00:53:45,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:53:45,274 INFO L225 Difference]: With dead ends: 201 [2021-10-13 00:53:45,274 INFO L226 Difference]: Without dead ends: 121 [2021-10-13 00:53:45,276 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:53:45,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-10-13 00:53:45,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2021-10-13 00:53:45,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 1.7542372881355932) internal successors, (207), 118 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:53:45,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 207 transitions. [2021-10-13 00:53:45,294 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 207 transitions. Word has length 17 [2021-10-13 00:53:45,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:53:45,294 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 207 transitions. [2021-10-13 00:53:45,295 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:53:45,295 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 207 transitions. [2021-10-13 00:53:45,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-10-13 00:53:45,297 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:53:45,297 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:53:45,297 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-13 00:53:45,297 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:53:45,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:53:45,298 INFO L82 PathProgramCache]: Analyzing trace with hash -545425190, now seen corresponding path program 1 times [2021-10-13 00:53:45,299 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:53:45,299 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753981424] [2021-10-13 00:53:45,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:53:45,300 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:53:45,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:53:45,345 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-13 00:53:45,346 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:53:45,346 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753981424] [2021-10-13 00:53:45,346 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753981424] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:53:45,347 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:53:45,347 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:53:45,347 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308706869] [2021-10-13 00:53:45,348 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:53:45,348 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:53:45,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:53:45,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:53:45,350 INFO L87 Difference]: Start difference. First operand 119 states and 207 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:53:45,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:53:45,368 INFO L93 Difference]: Finished difference Result 180 states and 310 transitions. [2021-10-13 00:53:45,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:53:45,369 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-10-13 00:53:45,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:53:45,371 INFO L225 Difference]: With dead ends: 180 [2021-10-13 00:53:45,371 INFO L226 Difference]: Without dead ends: 123 [2021-10-13 00:53:45,372 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:53:45,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2021-10-13 00:53:45,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2021-10-13 00:53:45,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 120 states have (on average 1.725) internal successors, (207), 120 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:53:45,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 207 transitions. [2021-10-13 00:53:45,383 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 207 transitions. Word has length 18 [2021-10-13 00:53:45,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:53:45,384 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 207 transitions. [2021-10-13 00:53:45,384 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:53:45,384 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 207 transitions. [2021-10-13 00:53:45,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-10-13 00:53:45,386 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:53:45,386 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:53:45,386 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-13 00:53:45,387 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:53:45,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:53:45,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1132231204, now seen corresponding path program 1 times [2021-10-13 00:53:45,388 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:53:45,388 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248096454] [2021-10-13 00:53:45,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:53:45,389 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:53:45,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:53:45,432 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-13 00:53:45,433 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:53:45,433 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248096454] [2021-10-13 00:53:45,433 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248096454] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:53:45,434 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:53:45,434 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:53:45,434 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026349199] [2021-10-13 00:53:45,435 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:53:45,435 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:53:45,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:53:45,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:53:45,436 INFO L87 Difference]: Start difference. First operand 121 states and 207 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:53:45,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:53:45,458 INFO L93 Difference]: Finished difference Result 345 states and 593 transitions. [2021-10-13 00:53:45,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:53:45,459 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-10-13 00:53:45,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:53:45,461 INFO L225 Difference]: With dead ends: 345 [2021-10-13 00:53:45,461 INFO L226 Difference]: Without dead ends: 231 [2021-10-13 00:53:45,463 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:53:45,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2021-10-13 00:53:45,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 229. [2021-10-13 00:53:45,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 228 states have (on average 1.6973684210526316) internal successors, (387), 228 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:53:45,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 387 transitions. [2021-10-13 00:53:45,504 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 387 transitions. Word has length 18 [2021-10-13 00:53:45,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:53:45,504 INFO L470 AbstractCegarLoop]: Abstraction has 229 states and 387 transitions. [2021-10-13 00:53:45,505 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:53:45,505 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 387 transitions. [2021-10-13 00:53:45,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-10-13 00:53:45,507 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:53:45,507 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:53:45,508 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-13 00:53:45,508 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:53:45,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:53:45,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1390396642, now seen corresponding path program 1 times [2021-10-13 00:53:45,511 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:53:45,512 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140846110] [2021-10-13 00:53:45,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:53:45,512 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:53:45,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:53:45,594 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-13 00:53:45,595 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:53:45,596 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140846110] [2021-10-13 00:53:45,597 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140846110] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:53:45,599 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:53:45,599 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:53:45,599 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753139824] [2021-10-13 00:53:45,600 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:53:45,601 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:53:45,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:53:45,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:53:45,604 INFO L87 Difference]: Start difference. First operand 229 states and 387 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:53:45,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:53:45,639 INFO L93 Difference]: Finished difference Result 289 states and 493 transitions. [2021-10-13 00:53:45,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:53:45,640 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-10-13 00:53:45,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:53:45,643 INFO L225 Difference]: With dead ends: 289 [2021-10-13 00:53:45,644 INFO L226 Difference]: Without dead ends: 287 [2021-10-13 00:53:45,645 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:53:45,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2021-10-13 00:53:45,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 229. [2021-10-13 00:53:45,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 228 states have (on average 1.6798245614035088) internal successors, (383), 228 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:53:45,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 383 transitions. [2021-10-13 00:53:45,678 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 383 transitions. Word has length 18 [2021-10-13 00:53:45,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:53:45,680 INFO L470 AbstractCegarLoop]: Abstraction has 229 states and 383 transitions. [2021-10-13 00:53:45,681 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:53:45,681 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 383 transitions. [2021-10-13 00:53:45,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-13 00:53:45,688 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:53:45,689 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-13 00:53:45,689 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-13 00:53:45,690 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:53:45,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:53:45,692 INFO L82 PathProgramCache]: Analyzing trace with hash -739214602, now seen corresponding path program 1 times [2021-10-13 00:53:45,692 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:53:45,693 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443302087] [2021-10-13 00:53:45,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:53:45,694 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:53:45,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:53:45,754 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-13 00:53:45,755 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:53:45,755 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443302087] [2021-10-13 00:53:45,755 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443302087] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:53:45,755 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:53:45,756 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:53:45,756 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133552281] [2021-10-13 00:53:45,756 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:53:45,757 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:53:45,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:53:45,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:53:45,758 INFO L87 Difference]: Start difference. First operand 229 states and 383 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:53:45,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:53:45,779 INFO L93 Difference]: Finished difference Result 421 states and 713 transitions. [2021-10-13 00:53:45,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:53:45,780 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-10-13 00:53:45,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:53:45,783 INFO L225 Difference]: With dead ends: 421 [2021-10-13 00:53:45,784 INFO L226 Difference]: Without dead ends: 419 [2021-10-13 00:53:45,785 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:53:45,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2021-10-13 00:53:45,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 321. [2021-10-13 00:53:45,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 320 states have (on average 1.646875) internal successors, (527), 320 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:53:45,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 527 transitions. [2021-10-13 00:53:45,800 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 527 transitions. Word has length 19 [2021-10-13 00:53:45,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:53:45,800 INFO L470 AbstractCegarLoop]: Abstraction has 321 states and 527 transitions. [2021-10-13 00:53:45,800 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:53:45,801 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 527 transitions. [2021-10-13 00:53:45,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-13 00:53:45,802 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:53:45,802 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-13 00:53:45,802 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-13 00:53:45,803 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:53:45,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:53:45,803 INFO L82 PathProgramCache]: Analyzing trace with hash -481049164, now seen corresponding path program 1 times [2021-10-13 00:53:45,803 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:53:45,804 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232883837] [2021-10-13 00:53:45,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:53:45,804 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:53:45,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:53:45,835 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-13 00:53:45,836 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:53:45,836 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232883837] [2021-10-13 00:53:45,836 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232883837] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:53:45,837 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:53:45,837 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:53:45,837 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383365173] [2021-10-13 00:53:45,838 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:53:45,838 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:53:45,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:53:45,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:53:45,839 INFO L87 Difference]: Start difference. First operand 321 states and 527 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:53:45,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:53:45,863 INFO L93 Difference]: Finished difference Result 757 states and 1249 transitions. [2021-10-13 00:53:45,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:53:45,864 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-10-13 00:53:45,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:53:45,868 INFO L225 Difference]: With dead ends: 757 [2021-10-13 00:53:45,868 INFO L226 Difference]: Without dead ends: 443 [2021-10-13 00:53:45,870 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:53:45,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2021-10-13 00:53:45,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 441. [2021-10-13 00:53:45,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 440 states have (on average 1.625) internal successors, (715), 440 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:53:45,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 715 transitions. [2021-10-13 00:53:45,892 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 715 transitions. Word has length 19 [2021-10-13 00:53:45,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:53:45,892 INFO L470 AbstractCegarLoop]: Abstraction has 441 states and 715 transitions. [2021-10-13 00:53:45,892 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:53:45,893 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 715 transitions. [2021-10-13 00:53:45,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-13 00:53:45,894 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:53:45,894 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-13 00:53:45,894 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-13 00:53:45,895 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:53:45,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:53:45,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1440601487, now seen corresponding path program 1 times [2021-10-13 00:53:45,895 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:53:45,896 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678299699] [2021-10-13 00:53:45,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:53:45,896 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:53:45,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:53:45,927 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-13 00:53:45,927 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:53:45,928 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678299699] [2021-10-13 00:53:45,928 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678299699] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:53:45,928 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:53:45,928 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:53:45,929 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673591252] [2021-10-13 00:53:45,929 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:53:45,929 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:53:45,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:53:45,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:53:45,931 INFO L87 Difference]: Start difference. First operand 441 states and 715 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:53:45,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:53:45,953 INFO L93 Difference]: Finished difference Result 669 states and 1081 transitions. [2021-10-13 00:53:45,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:53:45,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-10-13 00:53:45,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:53:45,957 INFO L225 Difference]: With dead ends: 669 [2021-10-13 00:53:45,957 INFO L226 Difference]: Without dead ends: 455 [2021-10-13 00:53:45,961 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:53:45,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2021-10-13 00:53:45,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 453. [2021-10-13 00:53:45,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 452 states have (on average 1.5995575221238938) internal successors, (723), 452 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:53:45,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 723 transitions. [2021-10-13 00:53:45,995 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 723 transitions. Word has length 20 [2021-10-13 00:53:45,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:53:45,995 INFO L470 AbstractCegarLoop]: Abstraction has 453 states and 723 transitions. [2021-10-13 00:53:45,996 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:53:45,996 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 723 transitions. [2021-10-13 00:53:45,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-13 00:53:45,997 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:53:45,998 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-13 00:53:45,998 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-13 00:53:45,998 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:53:45,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:53:45,999 INFO L82 PathProgramCache]: Analyzing trace with hash -2027407501, now seen corresponding path program 1 times [2021-10-13 00:53:46,000 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:53:46,000 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817613401] [2021-10-13 00:53:46,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:53:46,001 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:53:46,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:53:46,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-13 00:53:46,031 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:53:46,032 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817613401] [2021-10-13 00:53:46,032 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817613401] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:53:46,032 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:53:46,033 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:53:46,033 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912539532] [2021-10-13 00:53:46,033 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:53:46,034 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:53:46,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:53:46,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:53:46,035 INFO L87 Difference]: Start difference. First operand 453 states and 723 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:53:46,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:53:46,075 INFO L93 Difference]: Finished difference Result 809 states and 1309 transitions. [2021-10-13 00:53:46,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:53:46,076 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-10-13 00:53:46,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:53:46,082 INFO L225 Difference]: With dead ends: 809 [2021-10-13 00:53:46,083 INFO L226 Difference]: Without dead ends: 807 [2021-10-13 00:53:46,084 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:53:46,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2021-10-13 00:53:46,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 645. [2021-10-13 00:53:46,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 644 states have (on average 1.5574534161490683) internal successors, (1003), 644 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:53:46,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 1003 transitions. [2021-10-13 00:53:46,128 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 1003 transitions. Word has length 20 [2021-10-13 00:53:46,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:53:46,129 INFO L470 AbstractCegarLoop]: Abstraction has 645 states and 1003 transitions. [2021-10-13 00:53:46,129 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:53:46,129 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 1003 transitions. [2021-10-13 00:53:46,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-13 00:53:46,131 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:53:46,131 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-13 00:53:46,131 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-13 00:53:46,132 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:53:46,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:53:46,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1769242063, now seen corresponding path program 1 times [2021-10-13 00:53:46,132 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:53:46,133 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922275643] [2021-10-13 00:53:46,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:53:46,133 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:53:46,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:53:46,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:53:46,162 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:53:46,163 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922275643] [2021-10-13 00:53:46,163 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922275643] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:53:46,163 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:53:46,163 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:53:46,164 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91304384] [2021-10-13 00:53:46,164 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:53:46,164 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:53:46,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:53:46,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:53:46,165 INFO L87 Difference]: Start difference. First operand 645 states and 1003 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:53:46,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:53:46,236 INFO L93 Difference]: Finished difference Result 1497 states and 2333 transitions. [2021-10-13 00:53:46,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:53:46,237 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-10-13 00:53:46,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:53:46,244 INFO L225 Difference]: With dead ends: 1497 [2021-10-13 00:53:46,254 INFO L226 Difference]: Without dead ends: 871 [2021-10-13 00:53:46,256 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:53:46,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2021-10-13 00:53:46,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 869. [2021-10-13 00:53:46,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 869 states, 868 states have (on average 1.5334101382488479) internal successors, (1331), 868 states have internal predecessors, (1331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:53:46,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1331 transitions. [2021-10-13 00:53:46,301 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1331 transitions. Word has length 20 [2021-10-13 00:53:46,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:53:46,301 INFO L470 AbstractCegarLoop]: Abstraction has 869 states and 1331 transitions. [2021-10-13 00:53:46,301 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:53:46,302 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1331 transitions. [2021-10-13 00:53:46,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 00:53:46,304 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:53:46,304 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-13 00:53:46,304 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-13 00:53:46,304 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:53:46,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:53:46,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1575091945, now seen corresponding path program 1 times [2021-10-13 00:53:46,305 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:53:46,305 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130574842] [2021-10-13 00:53:46,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:53:46,306 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:53:46,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:53:46,343 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-13 00:53:46,344 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:53:46,344 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130574842] [2021-10-13 00:53:46,345 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130574842] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:53:46,345 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:53:46,345 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:53:46,345 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956326906] [2021-10-13 00:53:46,346 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:53:46,346 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:53:46,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:53:46,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:53:46,347 INFO L87 Difference]: Start difference. First operand 869 states and 1331 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:53:46,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:53:46,397 INFO L93 Difference]: Finished difference Result 1305 states and 1989 transitions. [2021-10-13 00:53:46,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:53:46,398 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-10-13 00:53:46,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:53:46,409 INFO L225 Difference]: With dead ends: 1305 [2021-10-13 00:53:46,409 INFO L226 Difference]: Without dead ends: 887 [2021-10-13 00:53:46,411 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:53:46,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2021-10-13 00:53:46,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 885. [2021-10-13 00:53:46,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 885 states, 884 states have (on average 1.505656108597285) internal successors, (1331), 884 states have internal predecessors, (1331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:53:46,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1331 transitions. [2021-10-13 00:53:46,463 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1331 transitions. Word has length 21 [2021-10-13 00:53:46,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:53:46,463 INFO L470 AbstractCegarLoop]: Abstraction has 885 states and 1331 transitions. [2021-10-13 00:53:46,464 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:53:46,464 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1331 transitions. [2021-10-13 00:53:46,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 00:53:46,466 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:53:46,467 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-13 00:53:46,467 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-13 00:53:46,468 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:53:46,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:53:46,468 INFO L82 PathProgramCache]: Analyzing trace with hash 988285931, now seen corresponding path program 1 times [2021-10-13 00:53:46,468 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:53:46,475 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907244705] [2021-10-13 00:53:46,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:53:46,476 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:53:46,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:53:46,530 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-13 00:53:46,531 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:53:46,531 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907244705] [2021-10-13 00:53:46,532 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907244705] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:53:46,532 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:53:46,532 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:53:46,532 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649116231] [2021-10-13 00:53:46,533 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:53:46,533 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:53:46,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:53:46,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:53:46,540 INFO L87 Difference]: Start difference. First operand 885 states and 1331 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:53:46,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:53:46,582 INFO L93 Difference]: Finished difference Result 1545 states and 2357 transitions. [2021-10-13 00:53:46,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:53:46,583 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-10-13 00:53:46,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:53:46,595 INFO L225 Difference]: With dead ends: 1545 [2021-10-13 00:53:46,595 INFO L226 Difference]: Without dead ends: 1543 [2021-10-13 00:53:46,599 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:53:46,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1543 states. [2021-10-13 00:53:46,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1543 to 1285. [2021-10-13 00:53:46,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1285 states, 1284 states have (on average 1.4602803738317758) internal successors, (1875), 1284 states have internal predecessors, (1875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:53:46,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1285 states to 1285 states and 1875 transitions. [2021-10-13 00:53:46,658 INFO L78 Accepts]: Start accepts. Automaton has 1285 states and 1875 transitions. Word has length 21 [2021-10-13 00:53:46,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:53:46,660 INFO L470 AbstractCegarLoop]: Abstraction has 1285 states and 1875 transitions. [2021-10-13 00:53:46,661 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:53:46,661 INFO L276 IsEmpty]: Start isEmpty. Operand 1285 states and 1875 transitions. [2021-10-13 00:53:46,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 00:53:46,664 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:53:46,664 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-13 00:53:46,664 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-13 00:53:46,665 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:53:46,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:53:46,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1246451369, now seen corresponding path program 1 times [2021-10-13 00:53:46,670 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:53:46,670 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520446619] [2021-10-13 00:53:46,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:53:46,671 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:53:46,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:53:46,715 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-13 00:53:46,716 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:53:46,716 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520446619] [2021-10-13 00:53:46,716 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520446619] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:53:46,716 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:53:46,716 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:53:46,717 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378974754] [2021-10-13 00:53:46,717 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:53:46,717 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:53:46,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:53:46,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:53:46,718 INFO L87 Difference]: Start difference. First operand 1285 states and 1875 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:53:46,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:53:46,765 INFO L93 Difference]: Finished difference Result 2953 states and 4309 transitions. [2021-10-13 00:53:46,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:53:46,766 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-10-13 00:53:46,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:53:46,776 INFO L225 Difference]: With dead ends: 2953 [2021-10-13 00:53:46,776 INFO L226 Difference]: Without dead ends: 1703 [2021-10-13 00:53:46,778 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:53:46,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states. [2021-10-13 00:53:46,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 1701. [2021-10-13 00:53:46,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1701 states, 1700 states have (on average 1.4323529411764706) internal successors, (2435), 1700 states have internal predecessors, (2435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:53:46,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1701 states to 1701 states and 2435 transitions. [2021-10-13 00:53:46,847 INFO L78 Accepts]: Start accepts. Automaton has 1701 states and 2435 transitions. Word has length 21 [2021-10-13 00:53:46,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:53:46,848 INFO L470 AbstractCegarLoop]: Abstraction has 1701 states and 2435 transitions. [2021-10-13 00:53:46,849 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:53:46,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1701 states and 2435 transitions. [2021-10-13 00:53:46,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-13 00:53:46,852 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:53:46,852 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:53:46,852 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-13 00:53:46,852 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:53:46,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:53:46,853 INFO L82 PathProgramCache]: Analyzing trace with hash 572308166, now seen corresponding path program 1 times [2021-10-13 00:53:46,853 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:53:46,855 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225261071] [2021-10-13 00:53:46,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:53:46,859 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:53:46,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:53:46,903 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-13 00:53:46,904 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:53:46,904 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225261071] [2021-10-13 00:53:46,904 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225261071] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:53:46,904 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:53:46,904 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:53:46,904 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35490340] [2021-10-13 00:53:46,905 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:53:46,905 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:53:46,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:53:46,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:53:46,906 INFO L87 Difference]: Start difference. First operand 1701 states and 2435 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:53:46,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:53:46,957 INFO L93 Difference]: Finished difference Result 2553 states and 3637 transitions. [2021-10-13 00:53:46,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:53:46,958 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-10-13 00:53:46,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:53:46,968 INFO L225 Difference]: With dead ends: 2553 [2021-10-13 00:53:46,969 INFO L226 Difference]: Without dead ends: 1735 [2021-10-13 00:53:46,973 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:53:46,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1735 states. [2021-10-13 00:53:47,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1735 to 1733. [2021-10-13 00:53:47,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1733 states, 1732 states have (on average 1.4058891454965359) internal successors, (2435), 1732 states have internal predecessors, (2435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:53:47,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2435 transitions. [2021-10-13 00:53:47,059 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2435 transitions. Word has length 22 [2021-10-13 00:53:47,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:53:47,059 INFO L470 AbstractCegarLoop]: Abstraction has 1733 states and 2435 transitions. [2021-10-13 00:53:47,059 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:53:47,060 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2435 transitions. [2021-10-13 00:53:47,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-13 00:53:47,062 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:53:47,062 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:53:47,062 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-13 00:53:47,063 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:53:47,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:53:47,063 INFO L82 PathProgramCache]: Analyzing trace with hash -14497848, now seen corresponding path program 1 times [2021-10-13 00:53:47,064 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:53:47,064 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607170285] [2021-10-13 00:53:47,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:53:47,064 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:53:47,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:53:47,094 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-13 00:53:47,094 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:53:47,094 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607170285] [2021-10-13 00:53:47,094 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607170285] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:53:47,094 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:53:47,095 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:53:47,095 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984885816] [2021-10-13 00:53:47,097 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:53:47,097 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:53:47,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:53:47,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:53:47,098 INFO L87 Difference]: Start difference. First operand 1733 states and 2435 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:53:47,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:53:47,161 INFO L93 Difference]: Finished difference Result 2953 states and 4197 transitions. [2021-10-13 00:53:47,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:53:47,162 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-10-13 00:53:47,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:53:47,178 INFO L225 Difference]: With dead ends: 2953 [2021-10-13 00:53:47,178 INFO L226 Difference]: Without dead ends: 2951 [2021-10-13 00:53:47,179 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:53:47,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2021-10-13 00:53:47,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 2565. [2021-10-13 00:53:47,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2565 states, 2564 states have (on average 1.361544461778471) internal successors, (3491), 2564 states have internal predecessors, (3491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:53:47,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2565 states to 2565 states and 3491 transitions. [2021-10-13 00:53:47,273 INFO L78 Accepts]: Start accepts. Automaton has 2565 states and 3491 transitions. Word has length 22 [2021-10-13 00:53:47,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:53:47,273 INFO L470 AbstractCegarLoop]: Abstraction has 2565 states and 3491 transitions. [2021-10-13 00:53:47,273 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:53:47,274 INFO L276 IsEmpty]: Start isEmpty. Operand 2565 states and 3491 transitions. [2021-10-13 00:53:47,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-13 00:53:47,278 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:53:47,278 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:53:47,278 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-13 00:53:47,279 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:53:47,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:53:47,279 INFO L82 PathProgramCache]: Analyzing trace with hash 243667590, now seen corresponding path program 1 times [2021-10-13 00:53:47,279 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:53:47,279 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313998659] [2021-10-13 00:53:47,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:53:47,280 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:53:47,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:53:47,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:53:47,317 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:53:47,317 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313998659] [2021-10-13 00:53:47,318 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313998659] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:53:47,318 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:53:47,318 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:53:47,318 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619868625] [2021-10-13 00:53:47,319 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:53:47,320 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:53:47,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:53:47,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:53:47,321 INFO L87 Difference]: Start difference. First operand 2565 states and 3491 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:53:47,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:53:47,433 INFO L93 Difference]: Finished difference Result 5833 states and 7909 transitions. [2021-10-13 00:53:47,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:53:47,434 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-10-13 00:53:47,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:53:47,452 INFO L225 Difference]: With dead ends: 5833 [2021-10-13 00:53:47,453 INFO L226 Difference]: Without dead ends: 3335 [2021-10-13 00:53:47,455 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:53:47,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3335 states. [2021-10-13 00:53:47,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3335 to 3333. [2021-10-13 00:53:47,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3333 states, 3332 states have (on average 1.3262304921968788) internal successors, (4419), 3332 states have internal predecessors, (4419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:53:47,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3333 states to 3333 states and 4419 transitions. [2021-10-13 00:53:47,587 INFO L78 Accepts]: Start accepts. Automaton has 3333 states and 4419 transitions. Word has length 22 [2021-10-13 00:53:47,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:53:47,588 INFO L470 AbstractCegarLoop]: Abstraction has 3333 states and 4419 transitions. [2021-10-13 00:53:47,588 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:53:47,588 INFO L276 IsEmpty]: Start isEmpty. Operand 3333 states and 4419 transitions. [2021-10-13 00:53:47,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-13 00:53:47,594 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:53:47,594 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-13 00:53:47,594 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-13 00:53:47,594 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:53:47,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:53:47,595 INFO L82 PathProgramCache]: Analyzing trace with hash -449217570, now seen corresponding path program 1 times [2021-10-13 00:53:47,595 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:53:47,596 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724855276] [2021-10-13 00:53:47,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:53:47,596 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:53:47,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:53:47,640 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-13 00:53:47,640 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:53:47,640 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724855276] [2021-10-13 00:53:47,641 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724855276] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:53:47,641 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:53:47,641 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:53:47,641 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411906465] [2021-10-13 00:53:47,643 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:53:47,643 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:53:47,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:53:47,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:53:47,644 INFO L87 Difference]: Start difference. First operand 3333 states and 4419 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:53:47,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:53:47,713 INFO L93 Difference]: Finished difference Result 5001 states and 6597 transitions. [2021-10-13 00:53:47,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:53:47,714 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-10-13 00:53:47,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:53:47,733 INFO L225 Difference]: With dead ends: 5001 [2021-10-13 00:53:47,733 INFO L226 Difference]: Without dead ends: 3399 [2021-10-13 00:53:47,736 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:53:47,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3399 states. [2021-10-13 00:53:47,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3399 to 3397. [2021-10-13 00:53:47,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3397 states, 3396 states have (on average 1.3012367491166077) internal successors, (4419), 3396 states have internal predecessors, (4419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:53:47,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3397 states to 3397 states and 4419 transitions. [2021-10-13 00:53:47,899 INFO L78 Accepts]: Start accepts. Automaton has 3397 states and 4419 transitions. Word has length 23 [2021-10-13 00:53:47,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:53:47,899 INFO L470 AbstractCegarLoop]: Abstraction has 3397 states and 4419 transitions. [2021-10-13 00:53:47,899 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:53:47,900 INFO L276 IsEmpty]: Start isEmpty. Operand 3397 states and 4419 transitions. [2021-10-13 00:53:47,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-13 00:53:47,905 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:53:47,906 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-13 00:53:47,906 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-13 00:53:47,906 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:53:47,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:53:47,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1036023584, now seen corresponding path program 1 times [2021-10-13 00:53:47,907 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:53:47,907 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066404946] [2021-10-13 00:53:47,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:53:47,908 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:53:47,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:53:47,941 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-13 00:53:47,942 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:53:47,942 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066404946] [2021-10-13 00:53:47,942 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066404946] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:53:47,942 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:53:47,943 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:53:47,943 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973973214] [2021-10-13 00:53:47,943 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:53:47,945 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:53:47,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:53:47,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:53:47,946 INFO L87 Difference]: Start difference. First operand 3397 states and 4419 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:53:48,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:53:48,069 INFO L93 Difference]: Finished difference Result 5641 states and 7365 transitions. [2021-10-13 00:53:48,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:53:48,069 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-10-13 00:53:48,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:53:48,126 INFO L225 Difference]: With dead ends: 5641 [2021-10-13 00:53:48,128 INFO L226 Difference]: Without dead ends: 5639 [2021-10-13 00:53:48,130 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:53:48,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5639 states. [2021-10-13 00:53:48,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5639 to 5125. [2021-10-13 00:53:48,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5125 states, 5124 states have (on average 1.2620999219359874) internal successors, (6467), 5124 states have internal predecessors, (6467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:53:48,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5125 states to 5125 states and 6467 transitions. [2021-10-13 00:53:48,302 INFO L78 Accepts]: Start accepts. Automaton has 5125 states and 6467 transitions. Word has length 23 [2021-10-13 00:53:48,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:53:48,303 INFO L470 AbstractCegarLoop]: Abstraction has 5125 states and 6467 transitions. [2021-10-13 00:53:48,303 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:53:48,303 INFO L276 IsEmpty]: Start isEmpty. Operand 5125 states and 6467 transitions. [2021-10-13 00:53:48,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-13 00:53:48,315 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:53:48,315 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-13 00:53:48,316 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-13 00:53:48,316 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:53:48,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:53:48,319 INFO L82 PathProgramCache]: Analyzing trace with hash -777858146, now seen corresponding path program 1 times [2021-10-13 00:53:48,319 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:53:48,319 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731752701] [2021-10-13 00:53:48,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:53:48,320 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:53:48,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:53:48,354 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-13 00:53:48,354 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:53:48,354 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731752701] [2021-10-13 00:53:48,355 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731752701] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:53:48,355 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:53:48,355 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:53:48,355 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946928312] [2021-10-13 00:53:48,356 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:53:48,356 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:53:48,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:53:48,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:53:48,358 INFO L87 Difference]: Start difference. First operand 5125 states and 6467 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:53:48,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:53:48,512 INFO L93 Difference]: Finished difference Result 11529 states and 14405 transitions. [2021-10-13 00:53:48,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:53:48,513 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-10-13 00:53:48,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:53:48,526 INFO L225 Difference]: With dead ends: 11529 [2021-10-13 00:53:48,527 INFO L226 Difference]: Without dead ends: 6535 [2021-10-13 00:53:48,534 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:53:48,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6535 states. [2021-10-13 00:53:48,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6535 to 6533. [2021-10-13 00:53:48,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6533 states, 6532 states have (on average 1.2154011022657685) internal successors, (7939), 6532 states have internal predecessors, (7939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:53:48,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6533 states to 6533 states and 7939 transitions. [2021-10-13 00:53:48,747 INFO L78 Accepts]: Start accepts. Automaton has 6533 states and 7939 transitions. Word has length 23 [2021-10-13 00:53:48,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:53:48,747 INFO L470 AbstractCegarLoop]: Abstraction has 6533 states and 7939 transitions. [2021-10-13 00:53:48,748 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:53:48,749 INFO L276 IsEmpty]: Start isEmpty. Operand 6533 states and 7939 transitions. [2021-10-13 00:53:48,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-13 00:53:48,759 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:53:48,759 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-13 00:53:48,759 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-13 00:53:48,759 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:53:48,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:53:48,760 INFO L82 PathProgramCache]: Analyzing trace with hash -2051743973, now seen corresponding path program 1 times [2021-10-13 00:53:48,760 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:53:48,761 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378006163] [2021-10-13 00:53:48,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:53:48,761 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:53:48,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:53:48,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:53:48,802 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:53:48,802 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378006163] [2021-10-13 00:53:48,803 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378006163] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:53:48,803 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:53:48,803 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:53:48,806 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807611818] [2021-10-13 00:53:48,806 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:53:48,807 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:53:48,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:53:48,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:53:48,809 INFO L87 Difference]: Start difference. First operand 6533 states and 7939 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:53:48,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:53:48,944 INFO L93 Difference]: Finished difference Result 9801 states and 11845 transitions. [2021-10-13 00:53:48,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:53:48,944 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-10-13 00:53:48,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:53:48,958 INFO L225 Difference]: With dead ends: 9801 [2021-10-13 00:53:48,958 INFO L226 Difference]: Without dead ends: 6663 [2021-10-13 00:53:48,964 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:53:48,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6663 states. [2021-10-13 00:53:49,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6663 to 6661. [2021-10-13 00:53:49,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6661 states, 6660 states have (on average 1.1920420420420421) internal successors, (7939), 6660 states have internal predecessors, (7939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:53:49,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6661 states to 6661 states and 7939 transitions. [2021-10-13 00:53:49,155 INFO L78 Accepts]: Start accepts. Automaton has 6661 states and 7939 transitions. Word has length 24 [2021-10-13 00:53:49,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:53:49,155 INFO L470 AbstractCegarLoop]: Abstraction has 6661 states and 7939 transitions. [2021-10-13 00:53:49,155 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:53:49,156 INFO L276 IsEmpty]: Start isEmpty. Operand 6661 states and 7939 transitions. [2021-10-13 00:53:49,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-13 00:53:49,165 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:53:49,166 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-13 00:53:49,166 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-13 00:53:49,166 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:53:49,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:53:49,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1656417309, now seen corresponding path program 1 times [2021-10-13 00:53:49,167 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:53:49,167 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236997064] [2021-10-13 00:53:49,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:53:49,168 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:53:49,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:53:49,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:53:49,217 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:53:49,217 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236997064] [2021-10-13 00:53:49,217 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236997064] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:53:49,217 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:53:49,217 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:53:49,218 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93155678] [2021-10-13 00:53:49,218 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:53:49,218 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:53:49,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:53:49,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:53:49,219 INFO L87 Difference]: Start difference. First operand 6661 states and 7939 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:53:49,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:53:49,383 INFO L93 Difference]: Finished difference Result 10759 states and 12676 transitions. [2021-10-13 00:53:49,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:53:49,383 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-10-13 00:53:49,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:53:49,405 INFO L225 Difference]: With dead ends: 10759 [2021-10-13 00:53:49,406 INFO L226 Difference]: Without dead ends: 10757 [2021-10-13 00:53:49,410 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:53:49,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10757 states. [2021-10-13 00:53:49,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10757 to 10245. [2021-10-13 00:53:49,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10245 states, 10244 states have (on average 1.1623389301054277) internal successors, (11907), 10244 states have internal predecessors, (11907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:53:49,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10245 states to 10245 states and 11907 transitions. [2021-10-13 00:53:49,726 INFO L78 Accepts]: Start accepts. Automaton has 10245 states and 11907 transitions. Word has length 24 [2021-10-13 00:53:49,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:53:49,726 INFO L470 AbstractCegarLoop]: Abstraction has 10245 states and 11907 transitions. [2021-10-13 00:53:49,727 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:53:49,727 INFO L276 IsEmpty]: Start isEmpty. Operand 10245 states and 11907 transitions. [2021-10-13 00:53:49,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-13 00:53:49,746 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:53:49,746 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-13 00:53:49,746 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-13 00:53:49,746 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:53:49,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:53:49,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1914582747, now seen corresponding path program 1 times [2021-10-13 00:53:49,747 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:53:49,748 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746789421] [2021-10-13 00:53:49,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:53:49,748 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:53:49,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:53:49,774 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-13 00:53:49,774 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:53:49,774 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746789421] [2021-10-13 00:53:49,775 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746789421] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:53:49,775 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:53:49,775 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:53:49,776 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959565894] [2021-10-13 00:53:49,777 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:53:49,777 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:53:49,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:53:49,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:53:49,778 INFO L87 Difference]: Start difference. First operand 10245 states and 11907 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:53:49,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:53:49,983 INFO L93 Difference]: Finished difference Result 22789 states and 25987 transitions. [2021-10-13 00:53:49,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:53:49,984 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-10-13 00:53:49,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:53:49,985 INFO L225 Difference]: With dead ends: 22789 [2021-10-13 00:53:49,985 INFO L226 Difference]: Without dead ends: 0 [2021-10-13 00:53:50,006 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:53:50,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-13 00:53:50,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-13 00:53:50,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:53:50,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-13 00:53:50,007 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2021-10-13 00:53:50,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:53:50,007 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-13 00:53:50,008 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:53:50,008 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-13 00:53:50,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-13 00:53:50,011 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:53:50,015 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-13 00:53:50,019 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-10-13 00:53:50,025 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:53:50,027 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:53:50,028 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:53:50,030 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 00:53:50,037 INFO L857 garLoopResultBuilder]: For program point L126-1(lines 38 146) no Hoare annotation was computed. [2021-10-13 00:53:50,037 INFO L857 garLoopResultBuilder]: For program point L102(line 102) no Hoare annotation was computed. [2021-10-13 00:53:50,037 INFO L857 garLoopResultBuilder]: For program point L127(line 127) no Hoare annotation was computed. [2021-10-13 00:53:50,038 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-10-13 00:53:50,038 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-10-13 00:53:50,038 INFO L857 garLoopResultBuilder]: For program point L111-1(lines 38 146) no Hoare annotation was computed. [2021-10-13 00:53:50,038 INFO L857 garLoopResultBuilder]: For program point L136-1(lines 38 146) no Hoare annotation was computed. [2021-10-13 00:53:50,038 INFO L857 garLoopResultBuilder]: For program point L95-1(lines 38 146) no Hoare annotation was computed. [2021-10-13 00:53:50,041 INFO L857 garLoopResultBuilder]: For program point L87-1(lines 38 146) no Hoare annotation was computed. [2021-10-13 00:53:50,042 INFO L857 garLoopResultBuilder]: For program point L112(line 112) no Hoare annotation was computed. [2021-10-13 00:53:50,043 INFO L857 garLoopResultBuilder]: For program point L79-1(lines 38 146) no Hoare annotation was computed. [2021-10-13 00:53:50,043 INFO L857 garLoopResultBuilder]: For program point L137(line 137) no Hoare annotation was computed. [2021-10-13 00:53:50,043 INFO L857 garLoopResultBuilder]: For program point L71-1(lines 38 146) no Hoare annotation was computed. [2021-10-13 00:53:50,043 INFO L857 garLoopResultBuilder]: For program point L63(lines 63 65) no Hoare annotation was computed. [2021-10-13 00:53:50,043 INFO L857 garLoopResultBuilder]: For program point L63-2(lines 38 146) no Hoare annotation was computed. [2021-10-13 00:53:50,043 INFO L857 garLoopResultBuilder]: For program point L121-1(lines 38 146) no Hoare annotation was computed. [2021-10-13 00:53:50,044 INFO L857 garLoopResultBuilder]: For program point L122(line 122) no Hoare annotation was computed. [2021-10-13 00:53:50,044 INFO L860 garLoopResultBuilder]: At program point L147(lines 7 151) the Hoare annotation is: true [2021-10-13 00:53:50,044 INFO L857 garLoopResultBuilder]: For program point L106-1(lines 38 146) no Hoare annotation was computed. [2021-10-13 00:53:50,044 INFO L857 garLoopResultBuilder]: For program point L40(lines 40 42) no Hoare annotation was computed. [2021-10-13 00:53:50,045 INFO L857 garLoopResultBuilder]: For program point L131-1(lines 38 146) no Hoare annotation was computed. [2021-10-13 00:53:50,045 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-10-13 00:53:50,045 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 149) no Hoare annotation was computed. [2021-10-13 00:53:50,045 INFO L857 garLoopResultBuilder]: For program point L107(line 107) no Hoare annotation was computed. [2021-10-13 00:53:50,045 INFO L857 garLoopResultBuilder]: For program point L132(line 132) no Hoare annotation was computed. [2021-10-13 00:53:50,046 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-10-13 00:53:50,046 INFO L857 garLoopResultBuilder]: For program point L91-1(lines 38 146) no Hoare annotation was computed. [2021-10-13 00:53:50,046 INFO L857 garLoopResultBuilder]: For program point L116-1(lines 38 146) no Hoare annotation was computed. [2021-10-13 00:53:50,046 INFO L857 garLoopResultBuilder]: For program point L83-1(lines 38 146) no Hoare annotation was computed. [2021-10-13 00:53:50,046 INFO L860 garLoopResultBuilder]: At program point L141-1(lines 38 146) the Hoare annotation is: true [2021-10-13 00:53:50,047 INFO L857 garLoopResultBuilder]: For program point L75-1(lines 38 146) no Hoare annotation was computed. [2021-10-13 00:53:50,047 INFO L857 garLoopResultBuilder]: For program point L67-1(lines 38 146) no Hoare annotation was computed. [2021-10-13 00:53:50,047 INFO L860 garLoopResultBuilder]: At program point L150(lines 6 151) the Hoare annotation is: true [2021-10-13 00:53:50,047 INFO L857 garLoopResultBuilder]: For program point L117(line 117) no Hoare annotation was computed. [2021-10-13 00:53:50,047 INFO L857 garLoopResultBuilder]: For program point L142(line 142) no Hoare annotation was computed. [2021-10-13 00:53:50,048 INFO L853 garLoopResultBuilder]: At program point L142-1(lines 7 151) the Hoare annotation is: false [2021-10-13 00:53:50,048 INFO L857 garLoopResultBuilder]: For program point L101-1(lines 38 146) no Hoare annotation was computed. [2021-10-13 00:53:50,053 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-13 00:53:50,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 12:53:50 BoogieIcfgContainer [2021-10-13 00:53:50,064 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-13 00:53:50,065 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-13 00:53:50,065 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-13 00:53:50,066 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-13 00:53:50,066 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:53:44" (3/4) ... [2021-10-13 00:53:50,069 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-13 00:53:50,082 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-10-13 00:53:50,082 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-10-13 00:53:50,083 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-13 00:53:50,083 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-13 00:53:50,133 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ce24a88-5ad8-4d5b-ac90-3a24ce10df8a/bin/uautomizer-WNIpwEf4Nt/witness.graphml [2021-10-13 00:53:50,133 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-13 00:53:50,135 INFO L168 Benchmark]: Toolchain (without parser) took 6784.66 ms. Allocated memory was 104.9 MB in the beginning and 283.1 MB in the end (delta: 178.3 MB). Free memory was 71.1 MB in the beginning and 90.5 MB in the end (delta: -19.4 MB). Peak memory consumption was 157.9 MB. Max. memory is 16.1 GB. [2021-10-13 00:53:50,136 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 104.9 MB. Free memory is still 58.7 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 00:53:50,136 INFO L168 Benchmark]: CACSL2BoogieTranslator took 310.19 ms. Allocated memory is still 104.9 MB. Free memory was 70.9 MB in the beginning and 79.5 MB in the end (delta: -8.6 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-13 00:53:50,137 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.77 ms. Allocated memory is still 104.9 MB. Free memory was 79.5 MB in the beginning and 77.8 MB in the end (delta: 1.8 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 00:53:50,137 INFO L168 Benchmark]: Boogie Preprocessor took 60.93 ms. Allocated memory is still 104.9 MB. Free memory was 77.8 MB in the beginning and 76.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-13 00:53:50,138 INFO L168 Benchmark]: RCFGBuilder took 401.80 ms. Allocated memory is still 104.9 MB. Free memory was 76.4 MB in the beginning and 64.9 MB in the end (delta: 11.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-13 00:53:50,138 INFO L168 Benchmark]: TraceAbstraction took 5888.01 ms. Allocated memory was 104.9 MB in the beginning and 283.1 MB in the end (delta: 178.3 MB). Free memory was 64.5 MB in the beginning and 94.7 MB in the end (delta: -30.2 MB). Peak memory consumption was 150.4 MB. Max. memory is 16.1 GB. [2021-10-13 00:53:50,139 INFO L168 Benchmark]: Witness Printer took 68.14 ms. Allocated memory is still 283.1 MB. Free memory was 94.7 MB in the beginning and 90.5 MB in the end (delta: 4.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-13 00:53:50,141 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.29 ms. Allocated memory is still 104.9 MB. Free memory is still 58.7 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 310.19 ms. Allocated memory is still 104.9 MB. Free memory was 70.9 MB in the beginning and 79.5 MB in the end (delta: -8.6 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 47.77 ms. Allocated memory is still 104.9 MB. Free memory was 79.5 MB in the beginning and 77.8 MB in the end (delta: 1.8 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 60.93 ms. Allocated memory is still 104.9 MB. Free memory was 77.8 MB in the beginning and 76.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 401.80 ms. Allocated memory is still 104.9 MB. Free memory was 76.4 MB in the beginning and 64.9 MB in the end (delta: 11.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 5888.01 ms. Allocated memory was 104.9 MB in the beginning and 283.1 MB in the end (delta: 178.3 MB). Free memory was 64.5 MB in the beginning and 94.7 MB in the end (delta: -30.2 MB). Peak memory consumption was 150.4 MB. Max. memory is 16.1 GB. * Witness Printer took 68.14 ms. Allocated memory is still 283.1 MB. Free memory was 94.7 MB in the beginning and 90.5 MB in the end (delta: 4.2 MB). Peak memory consumption was 2.1 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 - PositiveResult [Line: 149]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5804.3ms, OverallIterations: 25, TraceHistogramMax: 1, EmptinessCheckTime: 121.4ms, AutomataDifference: 2059.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 19.5ms, InitialAbstractionConstructionTime: 13.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1866 SDtfs, 922 SDslu, 1232 SDs, 0 SdLazy, 133 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 238.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 71.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=10245occurred in iteration=24, InterpolantAutomatonStates: 75, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 1859.0ms AutomataMinimizationTime, 25 MinimizatonAttempts, 2072 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 521 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 6.7ms HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 2.8ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 93.8ms SsaConstructionTime, 325.4ms SatisfiabilityAnalysisTime, 816.9ms InterpolantComputationTime, 505 NumberOfCodeBlocks, 505 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 480 ConstructedInterpolants, 0 QuantifiedInterpolants, 1011 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 6]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 RESULT: Ultimate proved your program to be correct! [2021-10-13 00:53:50,191 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ce24a88-5ad8-4d5b-ac90-3a24ce10df8a/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...